Sciweavers

3844 search results - page 596 / 769
» Distributed Meeting Scheduling
Sort
View
SC
1995
ACM
14 years 1 months ago
Efficient Support of Location Transparency in Concurrent Object-Oriented Programming Languages
We describe the design of a runtime system for a fine-grained concurrent object-oriented (actor) language and its performance. The runtime system provides considerable flexibility...
WooYoung Kim, Gul Agha
AICT
2005
IEEE
157views Communications» more  AICT 2005»
14 years 12 days 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»
13 years 12 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
13 years 12 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»
13 years 11 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...