1921 search results - page 264 / 385 » Making AC-3 an Optimal Algorithm |
121
click to vote
ECRTS
2007
IEEE
15 years 8 months ago
2007
IEEE
Since wireless ad-hoc networks use shared communication medium, accesses to the medium must be coordinated to avoid packet collisions. Transmission scheduling algorithms allocate ...
135
click to vote
ATAL
2006
Springer
15 years 6 months ago
2006
Springer
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
126
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
129
click to vote
MST
1998
15 years 2 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
134
Voted
PC
2010
15 years 28 days ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...