Sciweavers

1639 search results - page 119 / 328
» Anytime Heuristic Search
Sort
View
CEC
2008
IEEE
14 years 4 months ago
On the usefulness of infeasible solutions in evolutionary search: A theoretical study
— Evolutionary algorithms (EAs) have been widely used in optimization, where infeasible solutions are often encountered. Some EAs regard infeasible solutions as useless individua...
Yang Yu, Zhi-Hua Zhou
ICCS
2004
Springer
14 years 3 months ago
The Computational Complexity of Orientation Search in Cryo-Electron Microscopy
Abstract. In this paper we study the problem of determining threedimensional orientations for noisy projections of randomly oriented identical particles. The problem is of central ...
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...
ICDM
2003
IEEE
104views Data Mining» more  ICDM 2003»
14 years 3 months ago
Structure Search and Stability Enhancement of Bayesian Networks
Learning Bayesian network structure from large-scale data sets, without any expertspecified ordering of variables, remains a difficult problem. We propose systematic improvements ...
Hanchuan Peng, Chris H. Q. Ding
SEAL
1998
Springer
14 years 2 months ago
A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem
Abstract. This paper deals with the problem of nurse rostering in Belgian hospitals. This is a highly constrained real world problem that was (until the results of this research we...
Edmund K. Burke, Patrick De Causmaecker, Greet Van...
GECCO
2006
Springer
132views Optimization» more  GECCO 2006»
14 years 1 months ago
"Optimal" mutation rates for genetic search
Using a set of model landscapes we examine how different mutation rates affect different search metrics. We show that very universal heuristics, such as 1/N and the error threshol...
Jorge Cervantes, Christopher R. Stephens