2814 search results - page 99 / 563 » Competitive Analysis of Distributed Algorithms |
138
click to vote
VTC
2007
IEEE
15 years 8 months ago
2007
IEEE
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
122
click to vote
TCS
2010
15 years 20 days ago
2010
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles sear...
141
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
134
click to vote
PPOPP
1999
ACM
15 years 6 months ago
1999
ACM
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
162
click to vote
AI
2005
Springer
15 years 2 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...