253 search results - page 30 / 51 » Edge and Node Searching Problems on Trees |
IJCAI
1997
14 years 11 months ago
1997
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
AAAI
2010
14 years 11 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Constrained path problems have to do with finding paths in graphs subject to constraints. One way of constraining the graph is by enforcing reachability on nodes. For instance, i...
109
click to vote
TON
2002
14 years 9 months ago
2002
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
AIPS
2008
15 years 2 days ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...