It’s not every day that there’s a new OS in the works for 386 and 486-era hardware, but [John Swiderski] let us know he ...

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...

Abstract: In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, ...

Abstract: With the rapid evolution of electric systems, there has been a significant demand for energy Internet (EI) systems that allow sustainable and environmentally friendly energy management.

This repository contains a set of 1787 feasible instances for the 0-1 Knapsack Problem with Group Fairness. The instances are in folder instances and the generator used to create them is in folder ...

DNA computing has become the focus of computing research due to its excellent parallel processing capability, data storage capacity, and low energy consumption characteristics. DNA computational units ...

Uncertainties are widespread in the optimization of process systems, such as uncertainties in process technologies, prices, and customer demands. In this paper, we review the basic concepts and recent ...