Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
Efficient communication in Bluetooth scatternets requires design of intra and inter-piconet scheduling algorithms, and therefore numerous algorithms have been proposed. However, du...