Sciweavers

1628 search results - page 220 / 326
» Partitioning Sets with Genetic Algorithms
Sort
View
FUN
2007
Springer
80views Algorithms» more  FUN 2007»
14 years 1 months ago
The Traveling Beams Optical Solutions for Bounded NP-Complete Problems
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
Shlomi Dolev, Hen Fitoussi
CCCG
2001
13 years 11 months ago
Nearest neighbor search through function minimization
This paper describes a solution to the nearest neighbor problem. The proposed algorithm, which makes use of the triangle inequality property, is considered from a function minimiz...
Chang Shu, Michael A. Greenspan, Guy Godin
CAS
2008
68views more  CAS 2008»
13 years 10 months ago
Very Strongly Constrained Problems: an Ant Colony Optimization Approach
: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Vittorio Maniezzo, Matteo Roffilli
IJCV
2008
172views more  IJCV 2008»
13 years 9 months ago
Nonparametric Bayesian Image Segmentation
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous groups. We propose a nonparametric Bayesian model f...
Peter Orbanz, Joachim M. Buhmann
GECCO
2007
Springer
184views Optimization» more  GECCO 2007»
14 years 4 months ago
ECGA vs. BOA in discovering stock market trading experts
This paper presents two evolutionary algorithms, ECGA and BOA, applied to constructing stock market trading expertise, which is built on the basis of a set of specific trading ru...
Piotr Lipinski