364 search results - page 13 / 73 » A benchmark for the sorting network problem |
131
Voted
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly t...
138
click to vote
GECCO
2009
Springer
15 years 8 months ago
2009
Springer
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
142
Voted
IWCMC
2006
ACM
15 years 9 months ago
2006
ACM
Sensor devices are being embedded in all sorts of items including vehicles, furniture but also animal and human bodies through health monitors and tagging techniques. The collecti...
124
Voted
MST
1998
15 years 3 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
118
Voted
CPAIOR
2005
Springer
15 years 9 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing diïŹcult question âwhy my problem has no solutionâ. Moreover, explanations together with advanced searc...