3422 search results - page 516 / 685 » Random Subset Optimization |
106
click to vote
SPAA
1990
ACM
15 years 7 months ago
1990
ACM
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
139
click to vote
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
113
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
113
click to vote
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
Memetic algorithms are evolutionary algorithms incorporating local search to increase exploitation. This hybridization has been fruitful in countless applications. However, theory...
132
click to vote
GECCO
2000
Springer
15 years 6 months ago
2000
Springer
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...