Sciweavers

763 search results - page 82 / 153
» Engineering Shortest Path Algorithms
Sort
View
85
Voted
DAC
2002
ACM
16 years 3 months ago
A general probabilistic framework for worst case timing analysis
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...
Michael Orshansky, Kurt Keutzer
118
Voted
ESA
2010
Springer
142views Algorithms» more  ESA 2010»
15 years 3 months ago
The Geodesic Diameter of Polygonal Domains
This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), it is known that the geodesic diameter is determined...
Sang Won Bae, Matias Korman, Yoshio Okamoto
143
Voted
ICCI
1991
15 years 5 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
110
Voted
PDPTA
2007
15 years 3 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker
258
Voted

Lecture Notes
443views
17 years 2 days 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