2084 search results - page 287 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
204
Voted
TOMACS
2011
14 years 9 months ago
2011
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...
124
click to vote
JMLR
2010
14 years 9 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
134
click to vote
DC
2007
15 years 2 months ago
2007
Abstract Many reliable distributed systems are consensusbased and typically operate under two modes: a fast normal mode in failure-free synchronous periods, and a slower recovery m...
133
click to vote
HOTI
2002
IEEE
15 years 7 months ago
2002
IEEE
High-performance input-queued switches require highspeed scheduling algorithms while maintaining good performance. Various round-robin scheduling algorithms for Virtual Output Que...
168
click to vote
GECCO
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. A brachistochrone is the path along which a weighted particle falls most quickly from one point to another, and a catenary is the smooth curve connecting two points whose...