367 search results - page 55 / 74 » A memetic algorithm for graph coloring |
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
Hyper-heuristics can be thought of as “heuristics to choose heuristics”. They are concerned with adaptively finding solution methods, rather than directly producing a solutio...
GECCO
2009
Springer
14 years 3 months ago
2009
Springer
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
SIROCCO
2010
13 years 10 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
ICMCS
2007
IEEE
14 years 3 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...