Sciweavers

596 search results - page 17 / 120
» Search Strategies for Hybrid Search Spaces
Sort
View
CEC
2005
IEEE
14 years 1 months ago
On the complexity of overcoming gaps with isotropic mutations and elitist selection
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
Jens Jägersküpper
LCPC
2005
Springer
14 years 1 months ago
Analytic Models and Empirical Search: A Hybrid Approach to Code Optimization
Compilers employ system models, sometimes implicitly, to make code optimization decisions. These models are analytic; they reflect their implementor’s understanding and beliefs ...
Arkady Epshteyn, María Jesús Garzar&...
ECCV
2002
Springer
14 years 9 months ago
A Comparison of Search Strategies for Geometric Branch and Bound Algorithms
Over the last decade, a number of methods for geometric matching based on a branch-and-bound approach have been proposed. Such algorithms work by recursively subdividing transforma...
Thomas M. Breuel
CPAIOR
2009
Springer
14 years 2 months ago
Modelling Search Strategies in Rules2CP
In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modell...
François Fages, Julien Martin
AAAI
2004
13 years 9 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...