Sciweavers

2180 search results - page 98 / 436
» Comparing bio-inspired algorithms in constrained optimizatio...
Sort
View
AMC
2007
125views more  AMC 2007»
14 years 10 months ago
Geometric multigrid for high-order regularizations of early vision problems
The surface estimation problem is used as a model to demonstrate a framework for solving early vision problems by high-order regularization with natural boundary conditions. Becaus...
Stephen L. Keeling, Gundolf Haase
COR
2008
102views more  COR 2008»
14 years 9 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
EVOW
2006
Springer
15 years 1 months ago
Evolving the Structure of the Particle Swarm Optimization Algorithms
A new model for evolving the structure of a Particle Swarm Optimization (PSO) algorithm is proposed in this paper. The model is a hybrid technique that combines a Genetic Algorithm...
Laura Diosan, Mihai Oltean
GECCO
2007
Springer
262views Optimization» more  GECCO 2007»
15 years 4 months ago
Geometric particle swarm optimization for the sudoku puzzle
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
Alberto Moraglio, Julian Togelius
ICDM
2005
IEEE
143views Data Mining» more  ICDM 2005»
15 years 3 months ago
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
Daniel Lemire, Martin Brooks, Yuhong Yan