Sciweavers

3055 search results - page 392 / 611
» Randomized Search Trees
Sort
View
AAAI
1998
15 years 5 months ago
Optimal 2D Model Matching Using a Messy Genetic Algorithm
A Messy Genetic Algorithm is customized toflnd'optimal many-to-many matches for 2D line segment models. The Messy GA is a variant upon the Standard Genetic Algorithm in which...
J. Ross Beveridge
HM
2010
Springer
133views Optimization» more  HM 2010»
15 years 5 months ago
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
Luca Di Gaspero, Johannes Gärtner, Nysret Mus...
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
15 years 5 months ago
Genetic programming for finite algebras
We describe the application of genetic programming (GP) to a problem in pure mathematics, in the study of finite algebras. We document the production of human-competitive results...
Lee Spector, David M. Clark, Ian Lindsay, Bradford...
SIMPRA
2008
99views more  SIMPRA 2008»
15 years 3 months ago
Response surface methodology for constrained simulation optimization: An overview
This article summarizes `Generalized Response Surface Methodology'(GRSM), extending Box and Wilson's `Response Surface Methodology'(RSM). GRSM allows multiple rando...
Jack P. C. Kleijnen
HEURISTICS
2002
65views more  HEURISTICS 2002»
15 years 3 months ago
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
A GRASP (greedy randomized adaptive search procedure) is a multi-start metaheuristic for combinatorial optimization. We study the probability distributions of solution time to a su...
Renata M. Aiex, Mauricio G. C. Resende, Celso C. R...