511 search results - page 14 / 103 » Lower bounds for distributed markov chain problems |
PODC
1993
ACM
14 years 2 days ago
1993
ACM
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
ECCC
2010
13 years 8 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
SCP
2000
13 years 7 months ago
2000
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
CDC
2009
IEEE
13 years 5 months ago
2009
IEEE
Abstract-- We consider a variation of the classical MarkovDubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positi...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— Providing approximate max-min fair bandwidth allocation among flows within a network or at a single router has been an important research problem. In this paper, we study the ...