2924 search results - page 241 / 585 » Lower Bounds in Distributed Computing |
142
click to vote
ATAL
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
137
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
136
click to vote
SPAA
2004
ACM
15 years 9 months ago
2004
ACM
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
163
Voted
ICDCS
2000
IEEE
15 years 8 months ago
2000
IEEE
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studie...
166
click to vote
SPAA
1999
ACM
15 years 8 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...