2457 search results - page 48 / 492 » Local Search with Bootstrapping |
95
Voted
IJCAI
2001
15 years 2 months ago
2001
Many state-of-the-art heuristic planners derive their heuristic function by relaxing the planning task at hand, where the relaxation is to assume that all delete lists are empty. ...
122
click to vote
ALGORITHMICA
2010
15 years 25 days ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
97
Voted
SAC
2002
ACM
15 years 10 days ago
2002
ACM
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). ...
102
Voted
EC
2006
15 years 21 days ago
2006
This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossov...
111
Voted
WWW
2008
ACM
16 years 1 months ago
2008
ACM
For extracting the characteristics a specific geographic entity, and notably a place, we propose to use dynamic Extreme Tagging Systems in combination with the classic approach of...