533 search results - page 47 / 107 » Playing games with approximation algorithms |
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
We present Hintikka games for formulae of the probabilistic temporal logic PCTL and countable labeled Markov chains as models, giving an operational account of the denotational se...
AAAI
2008
13 years 10 months ago
2008
ion-Based Versus Potential-Aware Automated Abstraction in Imperfect Information Games: An Experimental Comparison Using Poker Andrew Gilpin and Tuomas Sandholm Computer Science Dep...
ACG
2006
Springer
14 years 1 months ago
2006
Springer
Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization a...
ALT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
TARK
1998
Springer
13 years 12 months ago
1998
Springer
We look at the Big Match game, a variation of the repeated Matching Pennies game where if the rst player plays tails the game ends with the rst player receiving the last round...