Sciweavers

1486 search results - page 107 / 298
» Algorithms for two-box covering
Sort
View
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
15 years 5 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,...
BMCBI
2004
125views more  BMCBI 2004»
15 years 3 months ago
A fast algorithm for determining the best combination of local alignments to a query sequence
Background: Existing sequence alignment algorithms assume that similarities between DNA or amino acid sequences are linearly ordered. That is, stretches of similar nucleotides or ...
Gavin C. Conant, Andreas Wagner

Lecture Notes
443views
17 years 1 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
ICIP
2004
IEEE
16 years 5 months ago
Performance analysis of an improved tensor based correspondence algorithm for automatic 3d modeling
3D modeling of a free-form object involves the acquisition of multiple views (range images) of the object to cover its entire surface. These views are then registered in a common ...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens
117
Voted
DAC
2009
ACM
16 years 5 months ago
Provably good and practically efficient algorithms for CMP dummy fill
Abstract--To reduce chip-scale topography variation in Chemical Mechanical Polishing (CMP) process, dummy fill is widely used to improve the layout density uniformity. Previous res...
Chunyang Feng, Hai Zhou, Changhao Yan, Jun Tao, Xu...