94 search results - page 10 / 19 » Generation of Tree Decompositions by Iterated Local Search |
ALENEX
2001
13 years 9 months ago
2001
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
CP
2003
Springer
14 years 26 days ago
2003
Springer
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
ML
2006
ACM
14 years 1 months ago
2006
ACM
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
IMR
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we propose a robust isotropic tetrahedral mesh generation method. An advancing front method is employed to control local mesh density and to easily preserve the ori...