Sciweavers

1550 search results - page 186 / 310
» Optimizing search by showing results in context
Sort
View
SARA
2005
Springer
15 years 12 months ago
Solving the 24 Puzzle with Instance Dependent Pattern Databases
A pattern database (PDB) is a heuristic function in a form of a lookup table which stores the cost of optimal solutions for instances of subproblems. bproblems are generated by abs...
Ariel Felner, Amir Adler
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
15 years 11 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
ECIS
2003
15 years 7 months ago
The value of cooperative planning in supply chains. A simulative approach
In this paper we examine, how the benefits of Supply Chain Management, as announced by the literature and widely accepted, can simulatively be proven. We first present selected re...
Luis Martín Díaz, Peter Buxmann
GECCO
2006
Springer
130views Optimization» more  GECCO 2006»
15 years 10 months ago
Pairwise sequence comparison for fitness evaluation in evolutionary structural software testing
Evolutionary algorithms are among the metaheuristic search methods that have been applied to the structural test data generation problem. Fitness evaluation methods play an import...
H. Turgut Uyar, A. Sima Etaner-Uyar, A. Emre Harma...
GECCO
2010
Springer
157views Optimization» more  GECCO 2010»
15 years 8 months ago
Mirrored variants of the (1, 4)-CMA-ES compared on the noiseless BBOB-2010 testbed
Derandomization by means of mirrored samples has been recently introduced to enhance the performances of (1, λ)Evolution-Strategies (ESs) with the aim of designing fast and robus...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen