1884 search results - page 35 / 377 » Simple Algorithm for Simple Timed Games |
108
click to vote
QEST
2008
IEEE
15 years 4 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
AAAI
1996
14 years 11 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We consider the one-person game of peg solitaire on a triangular board of arbitrary size. The basic game begins from a full board with one peg missing and finishes with one peg a...
ALGORITHMICA
2006
14 years 10 months ago
2006
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
AIIDE
2008
15 years 8 days ago
2008
Systems that provide automated game-design support-whether fully automated game generators, or tools to assist human designers--must be able to maintain a representation of a game...