1615 search results - page 145 / 323 » Pathology in heuristic search |
158
click to vote
ACG
2003
Springer
15 years 11 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...
168
click to vote
CSCLP
2006
Springer
15 years 10 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...
164
click to vote
CP
1995
Springer
15 years 10 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...
175
click to vote
AAAI
2004
15 years 7 months ago
2004
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a sub...
154
click to vote
ALENEX
2001
15 years 7 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....