Sciweavers

2694 search results - page 230 / 539
» Fully Distributed Algorithms for Convex Optimization Problem...
Sort
View
CEC
2008
IEEE
16 years 27 days ago
New evaluation criteria for the convergence of continuous evolutionary algorithms
—The first hitting time (FHT) plays an important role in convergence evaluation for evolutionary algorithms. However, the current criteria of the FHT are mostly under a hypothesi...
Ying Lin, Jian Huang, Jun Zhang
IPPS
2006
IEEE
16 years 13 days ago
A combined genetic-neural algorithm for mobility management
This work presents a new approach to solve the location management problem by using the location areas approach. A combination of a genetic algorithm and the Hopfield neural netwo...
Javid Taheri, Albert Y. Zomaya
PPSN
2010
Springer
15 years 4 months ago
Ant Colony Optimization with Immigrants Schemes in Dynamic Environments
Abstract. In recent years, there has been a growing interest in addressing dynamic optimization problems (DOPs) using evolutionary algorithms (EAs). Several approaches have been de...
Michalis Mavrovouniotis, Shengxiang Yang
PPSN
1998
Springer
15 years 10 months ago
Restart Scheduling for Genetic Algorithms
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
Alex S. Fukunaga
166
Voted
ICEC
1996
123views more  ICEC 1996»
15 years 7 months ago
Solving Symmetric and Asymmetric TSPs by Ant Colonies
- In this paper we present ACS, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants. We a...
Luca Maria Gambardella, Marco Dorigo