1884 search results - page 49 / 377 » Simple Algorithm for Simple Timed Games |
MST
2007
14 years 11 months ago
2007
In [Sch99], Sch¨oning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly...
TIT
2008
14 years 11 months ago
2008
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
101
click to vote
ICML
1994
IEEE
15 years 3 months ago
1994
IEEE
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
—We address a discrete-time, pursuit-evasion game with alternate moves played between two kinds of players: the pursuer and the evader. The pursuer wishes to capture the evader w...
TCS
2010
14 years 10 months ago
2010
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...