Sciweavers

118 search results - page 18 / 24
» Randomized Local Search, Evolutionary Algorithms, and the Mi...
Sort
View

Lecture Notes
443views
15 years 5 months ago
Design and Analysis of Computer Algorithms
"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 ...
David M. Mount
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 9 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
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....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
EVOW
2010
Springer
13 years 11 months ago
Ant Colony Optimization for Tree Decompositions
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...
Thomas Hammerl, Nysret Musliu
TCAD
2002
93views more  TCAD 2002»
13 years 7 months ago
Hierarchical buffered routing tree generation
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...
Amir H. Salek, Jinan Lou, Massoud Pedram
BMCBI
2010
135views more  BMCBI 2010»
13 years 7 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
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...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...