4565 search results - page 146 / 913 » Time Optimal Self-Stabilizing Algorithms |
STOC
2005
ACM
14 years 10 months ago
2005
ACM
In combinatorial optimization, a popular approach to NP-hard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guarante...
GECCO
1999
Springer
14 years 2 months ago
1999
Springer
This paper presents a study of parallel genetic algorithms (GAs) with multiple populations (also called demes or islands). The study makes explicit the relation between the probab...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract-- In many real-world scenarios, in contrast to standard benchmark optimization problems, we may face some uncertainties regarding the objective function. One source of the...
KES
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Grid computing is a computing framework to meet the growing computational demands. This paper introduces a novel approach based on Particle Swarm Optimization (PSO) for s...
ANTSW
2006
Springer
14 years 2 months ago
2006
Springer
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...