2084 search results - page 49 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
174
Voted
ICDCS
1995
IEEE
15 years 8 months ago
1995
IEEE
Tasks in a real-time application usually have several stringent timing, resource, and communication requirements. Designing a distributed computing system which can meet all these...
148
Voted
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
131
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...
127
click to vote
SAT
2005
Springer
15 years 10 months ago
2005
Springer
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
139
click to vote
IPCO
2010
15 years 6 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...