We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
Matroid theory gives us powerful techniques for understanding combinatorial optimization problems and for designing polynomial-time algorithms. However, several natural matroid pr...
Abstract--Multicarrier multiple access with channel knowledge and prescribed power at the transmitters is shown to maximize the sum-rate for circulant intersymbol-interference (ISI...
It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...
William M. Spears, Derek T. Green, Diana F. Spears