Sciweavers

2190 search results - page 233 / 438
» An optimal algorithm to generate tilings
Sort
View
EOR
2000
115views more  EOR 2000»
15 years 6 months ago
An effective implementation of the Lin-Kernighan traveling salesman heuristic
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
Keld Helsgaun
ATMOS
2010
136views Optimization» more  ATMOS 2010»
15 years 5 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel
ICASSP
2011
IEEE
14 years 10 months ago
Proximal splitting methods for depth estimation
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
Mireille El Gheche, Jean-Christophe Pesquet, Jouma...
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
15 years 12 months ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
GECCO
2004
Springer
132views Optimization» more  GECCO 2004»
15 years 12 months ago
Grammatical Swarm
Abstract. This proof of concept study examines the possibility of specifying the construction of programs using a Particle Swarm algorithm, and represents a new form of automatic p...
Michael O'Neill, Anthony Brabazon