1332 search results - page 78 / 267 » Combinatorial Algorithms |
ANTSW
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications us...
HEURISTICS
2002
13 years 9 months ago
2002
Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in ...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
Abstract. We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm ...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
WEA
2009
Springer
14 years 3 months ago
2009
Springer
We propose new practical algorithms to find degree-relaxed variants of cliques called s-plexes. An s-plex denotes a vertex subset in a graph inducing a subgraph where every vertex...