19 search results - page 2 / 4 » Winning Fast in Sparse Graph Construction Games |
89
Voted
JOLLI
2010
14 years 10 months ago
2010
Abstract. When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acqui...
89
Voted
SIAMCOMP
2002
14 years 11 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
MFCS
2010
Springer
14 years 10 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
101
click to vote
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
— In the lion and man game, a lion tries to capture a man who is as fast as the lion. We study a new version of this game which takes place in a Euclidean environment with a circ...