1717 search results - page 13 / 344 » On the analysis of the (1 1) memetic algorithm |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We consider server scheduling strategies to minimize average flow time in a multicast pull system where data items have uniform size. The algorithm Longest Wait First (LWF) always...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
FOCS
2000
IEEE
14 years 25 days ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
COCOON
2006
Springer
14 years 4 days ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
A survey of niching algorithms, based on 5 variants of derandomized Evolution Strategies (ES), is introduced. This set of niching algorithms, ranging from the very first derandom...