6437 search results - page 538 / 1288 » Parallel Algorithms for Arrangements |
184
click to vote
GECCO
2005
Springer
16 years 10 days ago
2005
Springer
Genetic Algorithms (GAs) are very commonly used as function optimizers, basically due to their search capability. A number of different serial and parallel versions of GA exist. ...
167
click to vote
PODC
2004
ACM
16 years 7 days ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
209
click to vote
DCOSS
2011
Springer
14 years 6 months ago
2011
Springer
—In many application scenarios sensors need to calculate the average of some local values, e.g. of local measurements. A possible solution is to rely on consensus algorithms. In ...
161
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
190
click to vote
MOBIHOC
2008
ACM
16 years 6 months ago
2008
ACM
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in ...