Sciweavers

1172 search results - page 82 / 235
» Path Algorithms on Regular Graphs
Sort
View
104
Voted
ISPASS
2006
IEEE
15 years 6 months ago
Critical path analysis of the TRIPS architecture
Fast, accurate, and effective performance analysis is essential for the design of modern processor architectures and improving application performance. Recent trends toward highly...
Ramadass Nagarajan, Xia Chen, Robert G. McDonald, ...
94
Voted
ICFEM
2000
Springer
15 years 4 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai
95
Voted
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
15 years 1 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
TON
2010
158views more  TON 2010»
14 years 11 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
15 years 4 months ago
Traversing the Machining Graph
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...
Danny Z. Chen, Rudolf Fleischer, Jian Li, Haitao W...