Sciweavers

1206 search results - page 38 / 242
» Convergence analysis of online algorithms
Sort
View
COR
2011
13 years 3 months ago
Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
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...
WAOA
2004
Springer
112views Algorithms» more  WAOA 2004»
14 years 1 months ago
Online Bin Packing with Resource Augmentation
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...
Leah Epstein, Rob van Stee
ECCC
2006
97views more  ECCC 2006»
13 years 8 months ago
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
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...
Frank Neumann, Carsten Witt
CEC
2008
IEEE
14 years 3 months ago
Analysis of reproduction operator in Bacterial Foraging Optimization Algorithm
— 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...
Ajith Abraham, Arijit Biswas, Sambarta Dasgupta, S...
ICASSP
2008
IEEE
14 years 2 months ago
Tracking analysis of the constant modulus algorithm
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...
Magno T. M. Silva, Vitor H. Nascimento