3360 search results - page 344 / 672 » An Optimal Distributed Edge-Biconnectivity Algorithm |
195
click to vote
JMLR
2010
15 years 1 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...
167
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time t...
198
click to vote
PIMRC
2010
IEEE
15 years 4 months ago
2010
IEEE
In this paper we show how game theory and Gibbs sampling techniques can be used to design a self-optimizing algorithm for minimizing end-to-end delays for all flows in a multi-clas...
197
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
211
click to vote
AI
2010
Springer
15 years 3 months ago
2010
Springer
How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such...