1639 search results - page 150 / 328 » Anytime Heuristic Search |
98
Voted
CEC
2007
IEEE
15 years 7 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
ACG
2003
Springer
15 years 6 months ago
2003
Springer
We describe two Go programs, ¢¡¤£¦¥ and ¢¡¤§¨£ , developed by a Monte-Carlo approach that is simpler than Bruegmann’s (1993) approach. Our method is based on Abra...
101
Voted
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
101
Voted
CP
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We fi...
95
Voted
ALENEX
2001
15 years 2 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....