112 search results - page 17 / 23 » Searching Game Trees in Parallel Using SSS |
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
75
Voted
AI
2006
Springer
14 years 9 months ago
2006
Springer
Deeper searches in game-playing programs relying on the minimax principle generally produce better results. Theoretical analyses, however, suggest that in many cases minimaxing am...
73
Voted
AAAI
1996
14 years 11 months ago
1996
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
ACMSE
2006
ACM
14 years 11 months ago
2006
ACM
The Lego Mindstorms Robot Command eXplorer (RCX) is a popular robotics kit that provides an immediate "out-of-the-box" opportunity to explore software controlled robot i...
85
Voted
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...