2084 search results - page 359 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...
MOBICOM
2009
ACM
15 years 4 months ago
2009
ACM
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
TON
2008
14 years 9 months ago
2008
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...
TC
2010
14 years 4 months ago
2010
It is imperative to design efficient and effective online spectrum allocation methods since requests for spectrums often come in an online fashion. In this paper, we propose SALSA,...
IOR
2007
14 years 9 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...