2252 search results - page 323 / 451 » Lower Bounds for Dynamic Algorithms |
120
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
134
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
130
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
120
Voted
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
127
click to vote
INFOCOM
2005
IEEE
15 years 9 months ago
2005
IEEE
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...