Sciweavers

1485 search results - page 57 / 297
» Whole Program Paths
Sort
View
ESA
2005
Springer
135views Algorithms» more  ESA 2005»
14 years 3 months ago
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
ICNP
2002
IEEE
14 years 2 months ago
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
Dahai Xu, Chunming Qiao, Yizhi Xiong
TON
1998
68views more  TON 1998»
13 years 9 months ago
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
CAPTECH
1998
Springer
14 years 1 months ago
Goal-Directed Navigation for Animated Characters Using Real-Time Path Planning and Control
Abstract. This paper presents a new technique for computing collisionfree navigation motions from task-level commands for animated human characters in interactive virtual environme...
James J. Kuffner Jr.
CN
2002
87views more  CN 2002»
13 years 9 months ago
Comparison of two path restoration schemes in self-healing networks
The state-independent (SI) and state-dependent (SD) path restoration schemes for self-healing networks are studied in this paper. The integer programming (IP) formulations for the...
Yijun Xiong, Lorne Mason