128 search results - page 25 / 26 » Computing optimal strategies to commit to in extensive-form ... |
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
AAAI
2007
13 years 8 months ago
2007
Much of artificial intelligence research is focused on devising optimal solutions for challenging and well-defined but highly constrained problems. However, as we begin creating...
KDD
2004
ACM
14 years 6 months ago
2004
ACM
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
ALT
2005
Springer
14 years 2 months ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
COCO
1994
Springer
13 years 10 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...