17760 search results - page 353 / 3552 » A Generalization of the Massey-Ding Algorithm |
167
click to vote
GECCO
2005
Springer
16 years 11 days ago
2005
Springer
Cellular genetic algorithms (cGAs) are mainly characterized by their spatially decentralized population, in which individuals can only interact with their neighbors. In this work,...
237
click to vote
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
160
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Semidefinite programming based approximation algorithms, such as the Goemans and Williamson approximation algorithm for the MAX CUT problem, are usually shown to have certain perf...
167
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper, we present two new run-time algorithms for the parallelization of loops that have indirect access patterns. The algorithms can handle any type of loop-carried depen...
186
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...