1550 search results - page 127 / 310 » Optimizing search by showing results in context |
GECCO
2008
Springer
13 years 10 months ago
2008
Springer
Rigorous runtime analyses of evolutionary algorithms (EAs) mainly investigate algorithms that use elitist selection methods. Two algorithms commonly studied are Randomized Local S...
SAC
2011
ACM
13 years 4 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract— In this paper, we study parallelization of multiobjective optimization algorithms on a set of hetergeneous resources based on the Master-Slave model. Master-Slave model...
CP
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Table constraints play an important role within constraint programming. Recently, many schemes or algorithms have been proposed to propagate table constraints or/and to c...
DSD
2010
IEEE
13 years 9 months ago
2010
IEEE
—Although many efficient high-level algorithms have been proposed for the realization of Multiple Constant Multiplications (MCM) using the fewest number of addition and subtract...