Sciweavers

693 search results - page 36 / 139
» Complexity Analysis of Heuristic CSP Search Algorithms
Sort
View
CEC
2010
IEEE
14 years 5 months ago
A hybrid genetic algorithm for rescue path planning in uncertain adversarial environment
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
Jean Berger, Khaled Jabeur, Abdeslem Boukhtouta, A...
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 8 months ago
A building-block royal road where crossover is provably essential
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
Richard A. Watson, Thomas Jansen
OSS
2009
Springer
15 years 8 months ago
Estimating Commit Sizes Efficiently
The quantitative analysis of software projects can provide insights that let us better understand open source and other software development projects. An important variable used in...
Philipp Hofmann, Dirk Riehle
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 6 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....
DDECS
2007
IEEE
175views Hardware» more  DDECS 2007»
15 years 8 months ago
Analyzing Test and Repair Times for 2D Integrated Memory Built-in Test and Repair
—An efficient on-chip infrastructure for memory test and repair is crucial to enhance yield and availability of SoCs. A commonly used repair strategy is to equip memories with sp...
Philipp Öhler, Sybille Hellebrand, Hans-Joach...