2899 search results - page 374 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
153
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
176
click to vote
IPPS
2007
IEEE
16 years 24 days ago
2007
IEEE
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
167
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
One of the most controversial yet enduring hypotheses about what genetic algorithms (GAs) are good for concerns the idea that GAs process building-blocks. More specifically, it ha...
163
click to vote
GECCO
2007
Springer
16 years 19 days ago
2007
Springer
Markov Networks (also known as Markov Random Fields) have been proposed as a new approach to probabilistic modelling in Estimation of Distribution Algorithms (EDAs). An EDA employ...
175
click to vote
MEMOCODE
2006
IEEE
16 years 15 days ago
2006
IEEE
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...