Sciweavers

3098 search results - page 494 / 620
» On distributed smooth scheduling
Sort
View
AICT
2005
IEEE
157views Communications» more  AICT 2005»
15 years 7 months ago
Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Automatic repeat request (ARQ) schemes are effective to recover non-real-time data corrupted by channel errors, but their use with real-time traffic is seldom considered because p...
Jose A. Afonso, Joaquim E. Neves
SODA
2008
ACM
110views Algorithms» more  SODA 2008»
15 years 7 months ago
Fast asynchronous byzantine agreement and leader election with full information
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
Bruce M. Kapron, David Kempe, Valerie King, Jared ...
AAAI
2004
15 years 7 months ago
Regrets Only! Online Stochastic Optimization under Time Constraints
This paper considers online stochastic optimization problems where time constraints severely limit the number of offline optimizations which can be performed at decision time and/...
Russell Bent, Pascal Van Hentenryck
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
15 years 7 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...
WEBNET
2001
15 years 7 months ago
Designing a Collaboration Environment for Teleworkers
: Teleworking enables a more flexible scheduling of working time and places of work on the way to the modern information society. The rapid development of cooperative application s...
Iris Braun, Ulf Zschuckelt