39 search results - page 5 / 8 » Solving Probabilistic Combinatorial Games |
ICTAI
1999
IEEE
14 years 1 days ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
JMLR
2006
13 years 7 months ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
AI
1999
Springer
13 years 7 months ago
1999
Springer
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
In this paper we propose a general framework to solve the articulated shape matching problem, formulated as finding point-to-point correspondences between two shapes represented b...