6105 search results - page 840 / 1221 » A Parallel Algorithm for Bound-Smoothing |
200
click to vote
FTDCS
2003
IEEE
16 years 22 days ago
2003
IEEE
We propose a new model for on-demand media streaming centered around the peer-to-peer (P2P) paradigm. The proposed P2P model can support a large number of clients with a low overa...
243
click to vote
ICPP
2003
IEEE
16 years 22 days ago
2003
IEEE
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
140
Voted
IPPS
2003
IEEE
16 years 22 days ago
2003
IEEE
Given a set of service requests, each char acterize d by a temporal interval and a category, an integer k, and an integer hc for each categoryc, the Server A llocation with Bounde...
203
click to vote
SPAA
2003
ACM
16 years 21 days ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
177
Voted
SPAA
2003
ACM
16 years 21 days ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...