16 search results - page 1 / 4 » On Optimal Game-Tree Search using Rational Meta-Reasoning |
IJCAI
1989
13 years 6 months ago
1989
JMLR
2010
12 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
AAAI
2010
13 years 6 months ago
2010
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
IACR
2011
12 years 4 months ago
2011
We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels i...
AAAI
2010
13 years 6 months ago
2010
Web search engines respond to a query by returning more results than can be reasonably reviewed. These results typically include the title, link, and snippet of content from the t...