2924 search results - page 351 / 585 » Lower Bounds in Distributed Computing |
146
click to vote
QEST
2008
IEEE
15 years 11 months ago
2008
IEEE
Magnifying Lens Abstraction in Markov Decision Processes ∗ Pritam Roy1 David Parker2 Gethin Norman2 Luca de Alfaro1 Computer Engineering Dept, UC Santa Cruz, Santa Cruz, CA, USA ...
147
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...
244
click to vote
ICDE
2007
IEEE
16 years 6 months ago
2007
IEEE
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
133
click to vote
ICML
2009
IEEE
16 years 5 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...
130
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
- In this paper we introduce Priority Based Forced Requeue to decrease worst-case latencies in NoCs offering best effort services. Forced Requeue is to prematurely lift out low pri...