Sciweavers

2407 search results - page 339 / 482
» The evolutionary forest algorithm
Sort
View
CEC
2011
IEEE
14 years 5 months ago
Accelerating convergence towards the optimal pareto front
—Evolutionary algorithms have been very popular optimization methods for a wide variety of applications. However, in spite of their advantages, their computational cost is still ...
Mohsen Davarynejad, Jafar Rezaei, Jos L. M. Vranck...
CEC
2011
IEEE
14 years 5 months ago
Oppositional biogeography-based optimization for combinatorial problems
Abstract—In this paper, we propose a framework for employing opposition-based learning to assist evolutionary algorithms in solving discrete and combinatorial optimization proble...
Mehmet Ergezer, Dan Simon
CVPR
2012
IEEE
13 years 7 months ago
Parameter-free/Pareto-driven procedural 3D reconstruction of buildings from ground-level sequences
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
Loïc Simon, Olivier Teboul, Panagiotis Koutso...
CEC
2008
IEEE
15 years 11 months ago
On the scalability of particle swarm optimisation
— Particle swarm has proven to be competitive to other evolutionary algorithms in the field of optimization, and in many cases enables a faster convergence to the ideal solution...
Sébastien Piccand, Michael O'Neill, Jacquel...
121
Voted
COR
2007
112views more  COR 2007»
15 years 5 months ago
The bi-objective covering tour problem
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
Nicolas Jozefowiez, Frédéric Semet, ...