16 search results - page 3 / 4 » On Pruning Techniques for Multi-Player Games |
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
CDC
2009
IEEE
14 years 17 days ago
2009
IEEE
— In recent years, idempotent methods (specifically, max-plus methods) have been developed for solution of nonlinear control problems. It was thought that idempotent linearity o...
AAAI
2000
13 years 9 months ago
2000
In this paper, we present PQSOLVE, a distributed theorem-prover for Quantified Boolean Formulae. First, we introduce our sequential algorithm QSOLVE, which uses new heuristics and...
ACG
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we present our ideas for an Arimaa-playing program (also called a bot) that uses plans and pattern matching to guide a highly selective search. We restrict move gener...
COCO
1991
Springer
13 years 11 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...