Sciweavers

725 search results - page 10 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
CEC
2009
IEEE
15 years 4 months ago
Dispatching rules for production scheduling: A hyper-heuristic landscape analysis
— Hyper-heuristics or “heuristics to chose heuristics” are an emergent search methodology that seeks to automate the process of selecting or combining simpler heuristics in o...
Gabriela Ochoa, José Antonio Vázquez...
EC
2007
167views ECommerce» more  EC 2007»
14 years 9 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud
GECCO
2004
Springer
119views Optimization» more  GECCO 2004»
15 years 3 months ago
Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem
Randomized search heuristics, among them randomized local search and evolutionary algorithms, are applied to problems whose structure is not well understood, as well as to problems...
Frank Neumann, Ingo Wegener
HICSS
1997
IEEE
107views Biometrics» more  HICSS 1997»
15 years 2 months ago
On Heuristic Mapping of Decision Surfaces for Post-Evaluation Analysis
The value for decision making of high-quality postsolution analysis of decision-supporting models can hardly be overestimated. Candle-lighting analysis (CLA) takes this notion ver...
Major Bill Branley, Russell Fradin, Steven O. Kimb...
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
15 years 3 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher