350 search results - page 5 / 70 » On Strategy Improvement Algorithms for Simple Stochastic Gam... |
PDCAT
2004
Springer
15 years 2 months ago
2004
Springer
DFS has previously been shown to be a simple and efficient strategy for removing cycles in graphs allowing the resulting DAGs to be scheduled using one of the many well-established...
AAAI
2004
14 years 10 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
IJCAI
2001
14 years 10 months ago
2001
We present a sample re-weighting scheme inspired by recent results in margin theory. The basic idea is to add to the training set replicas of samples which are not classified with...
COCOA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
GI
2009
Springer
14 years 7 months ago
2009
Springer
: ConnectIT uses a graphical representation to express strategies for playing the connect-four game. With this tool we can transfer complex knowledge about the connect-four game it...