We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
Sven Oliver Krumke, Alfred Taudes, Stephan Westpha...
In competitive analysis, we usually do not put any restrictions on the computational complexity of online algorithms, although efficient algorithms are preferred. Thus if such an...
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
— One of the major driving forces of Bacterial Foraging Optimization Algorithm (BFOA) is the reproduction phenomenon of virtual bacteria each of which models one trial solution o...
Recently, we proposed a model for the steady-state estimation error of real-valued constant-modulus-based algorithms as a function of the a priori error and of a term that measure...