Sciweavers

3678 search results - page 73 / 736
» On the Stable Paths Problem
Sort
View
114
Voted
CCCG
2010
15 years 2 months ago
The traveling salesman problem for lines and rays in the plane
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. In the path variant, we...
Adrian Dumitrescu
100
Voted
VTS
2000
IEEE
94views Hardware» more  VTS 2000»
15 years 5 months ago
On Testing the Path Delay Faults of a Microprocessor Using its Instruction Set
1 This paper addresses the problem of testing path delay faults in a microprocessor using instructions. It is observed that a structurally testable path (i.e., a path testable thro...
Wei-Cheng Lai, Angela Krstic, Kwang-Ting Cheng
DAC
2010
ACM
15 years 4 months ago
An efficient algorithm to verify generalized false paths
Timing exception verification has become a center of interest as incorrect constraints can lead to chip failures. Proving that a false path is valid or not is a difficult problem ...
Olivier Coudert
ESA
1998
Springer
108views Algorithms» more  ESA 1998»
15 years 4 months ago
Finding an Optimal Path without Growing the Tree
In this paper, we study a class of optimal path problems with the following phenomenon: The space complexity of the algorithms for reporting the lengths of single-source optimal pa...
Danny Z. Chen, Ovidiu Daescu, Xiaobo Hu, Jinhui Xu
82
Voted
DM
2010
103views more  DM 2010»
15 years 22 days ago
Rainbow paths
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
Domingos Dellamonica Jr., Colton Magnant, Daniel M...