87 search results - page 14 / 18 » Dynamic Programming for Partially Observable Stochastic Game... |
99
Voted
ML
2006
ACM
14 years 11 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
AAAI
1998
15 years 29 days ago
1998
Poker is an interesting test-bed for artificial intelligence research. It is a game of imperfect knowledge, where multiple competing agents must deal with risk management, agent m...
LAMAS
2005
Springer
15 years 5 months ago
2005
Springer
Use of tags to limit partner selection for playing has been shown to produce stable cooperation in agent populations playing the Prisoner’s Dilemma game. There is, however, a lac...
100
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we present an analytic model and methodology to determine optimal scheduling policy that involves two dimension space allocation: time and code, in High Speed Do...
UAI
2004
15 years 29 days ago
2004
We present a major improvement to the incremental pruning algorithm for solving partially observable Markov decision processes. Our technique targets the cross-sum step of the dyn...