1026 search results - page 92 / 206 » An Optimal Solution to Room Search Problem |
171
click to vote
IROS
2007
IEEE
16 years 16 days ago
2007
IEEE
– A problem of searching with multiple searchers and scouts is presented. Unlike most search problems that terminate as soon as the target is found, successful detections by scou...
154
click to vote
AI
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. In this paper, we study the behaviour of the Scaling and Probabilistic Smoothing (SAPS) dynamic local search algorithm on the unweighted MAXSAT problem. MAX-SAT is a conc...
173
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We propose a hybrid algorithm (called ALPINE) between Genetic Algorithm and Dantzig's Simplex method to approximate optimal solutions for the Flexible Job-Shop Problem. Local...
198
click to vote
EOR
2006
15 years 6 months ago
2006
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
186
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper introduces a new technique called adaptive elitistpopulation search method for allowing unimodal function optimization methods to be extended to efficiently lo...