1376 search results - page 172 / 276 » Searching Trees: An Essay |
163
click to vote
ICCBR
2007
Springer
16 years 17 days ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
168
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
173
click to vote
EMO
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
198
click to vote
AMAI
2004
Springer
15 years 11 months ago
2004
Springer
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
141
click to vote
SC
2000
ACM
15 years 10 months ago
2000
ACM
Recent advances in DNA sequencing technology have created large data sets upon which phylogenetic inference can be performed. However, current research is limited by the prohibiti...