Sciweavers

1026 search results - page 81 / 206
» An Optimal Solution to Room Search Problem
Sort
View
GECCO
2008
Springer
161views Optimization» more  GECCO 2008»
15 years 7 months ago
A new quantum behaved particle swarm optimization
This paper presents a variant of Quantum behaved Particle Swarm Optimization (QPSO) named Q-QPSO for solving global optimization problems. The Q-QPSO algorithm is based on the cha...
Millie Pant, Radha Thangaraj, Ajith Abraham
SCALESPACE
2009
Springer
16 years 26 days ago
Momentum Based Optimization Methods for Level Set Segmentation
Abstract. Segmentation of images is often posed as a variational problem. As such, it is solved by formulating an energy functional depending on a contour and other image derived t...
Gunnar Läthén, Thord Andersson, Reiner...
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
16 years 26 days ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann
EOR
2007
364views more  EOR 2007»
15 years 6 months ago
Heuristics for the mirrored traveling tournament problem
Professional sports leagues are a major economic activity around the world. Teams and leagues do not want to waste their investments in players and structure in consequence of poo...
Celso C. Ribeiro, Sebastián Urrutia
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 6 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet