4313 search results - page 533 / 863 » Using time travel to diagnose computer problems |
201
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
Adaptive Memetic Algorithms couple an evolutionary algorithm with a number of local search heuristics for improving the evolving solutions. They are part of a broad family of meta...
187
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
205
click to vote
IROS
2006
IEEE
16 years 1 months ago
2006
IEEE
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...
196
click to vote
ATAL
2006
Springer
15 years 11 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
207
click to vote
TCBB
2008
15 years 7 months ago
2008
Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new adva...