Sciweavers

1594 search results - page 65 / 319
» An Algorithm to Compute Collusion Paths
Sort
View
119
Voted
ITC
2003
IEEE
167views Hardware» more  ITC 2003»
15 years 8 months ago
Path Delay Test Generation for Domino Logic Circuits in the Presence of Crosstalk
A technique to derive test vectors that exercise the worstcase delay effects in a domino circuit in the presence of crosstalk is described. A model for characterizing the delay of...
Rahul Kundu, R. D. (Shawn) Blanton
QSHINE
2005
IEEE
15 years 8 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
143
Voted
4OR
2010
148views more  4OR 2010»
15 years 1 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
COCOON
2011
Springer
14 years 2 months ago
Finding Paths with Minimum Shared Edges
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
Masoud T. Omran, Jörg-Rüdiger Sack, Hami...
GISCIENCE
2008
Springer
141views GIS» more  GISCIENCE 2008»
15 years 4 months ago
Simplest Instructions: Finding Easy-to-Describe Routes for Navigation
Abstract. Current applications for wayfinding and navigation assistance usually calculate the route to a destination based on the shortest or fastest path from the origin. However...
Kai-Florian Richter, Matt Duckham