118 search results - page 18 / 24 » Randomized Local Search, Evolutionary Algorithms, and the Mi... |
266
click to vote
Lecture Notes
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
111
click to vote
ALENEX
2001
15 years 4 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....
121
click to vote
EVOW
2010
Springer
15 years 7 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
123
click to vote
TCAD
2002
15 years 2 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
121
click to vote
BMCBI
2010
15 years 3 months ago
2010
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...