91 search results - page 14 / 19 » Finding an Optimal Path without Growing the Tree |
STOC
2004
ACM
15 years 12 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
TSP
2010
14 years 6 months ago
2010
We formulate and study a decentralized multi-armed bandit (MAB) problem. There are distributed players competing for independent arms. Each arm, when played, offers i.i.d. reward a...
85
Voted
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
Program analysis is the heart of modern compilers. Most control flow analyses are reduced to the problem of finding a fixed point in a certain transition system, and such fixed po...
112
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
There is growing interest in multi-robot frequency-based patrolling, in which a team of robots optimizes its frequency of point visits, for every point in a target work area. In p...
124
click to vote
CVPR
2009
IEEE
16 years 6 months ago
2009
IEEE
Multiple view 3D video reconstruction of actor performance
captures a level-of-detail for body and clothing
movement which is time-consuming to produce using existing
animation ...