14548 search results - page 108 / 2910 » The Optimal Path-Matching Problem |
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
ICCV
2005
IEEE
15 years 1 days ago
2005
IEEE
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
GECCO
2008
Springer
13 years 11 months ago
2008
Springer
Recently, a number of works have been done on how to use Genetic Algorithms to solve the Portfolio Optimization problem, which is an instance of the Resource Allocation problem cl...
JUCS
2007
13 years 10 months ago
2007
: Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that re...
EVOW
2005
Springer
14 years 3 months ago
2005
Springer
We focus on the Golomb ruler problem, a hard constrained combinatorial optimization problem. Two alternative encodings are considered, one based on the direct representation of sol...