2084 search results - page 241 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
SWAT
2004
Springer
15 years 3 months ago
2004
Springer
We show that any priority queue data structure that supports insert, delete, and find-min operations in pq(n) time, when n is an upper bound on the number of elements in the prio...
IWQOS
2004
Springer
15 years 3 months ago
2004
Springer
— We propose an algorithm for design and on the fly modification of the schedule of a wireless ad hoc network for provision of fair service guarantees under topological changes...
ICPP
2003
IEEE
15 years 3 months ago
2003
IEEE
Any reliable multicast protocol requires some recovery mechanism. A generic description of a recovery mechanism consists of a prioritized list of recovery servers/receivers (clien...
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Traditionally, slotted communication protocols have employed guard times to delineate and align slots. These guard times may expand the slot duration significantly, especially...