Sciweavers

866 search results - page 102 / 174
» On Dynamic Shortest Paths Problems
Sort
View
MEMOCODE
2007
IEEE
14 years 4 months ago
Combining Multi-Valued Logics in SAT-based ATPG for Path Delay Faults
Due to the rapidly growing speed and the decreasing size of gates in modern chips, the probability of faults caused by the production process grows. Already small variations lead ...
Stephan Eggersglüß, Görschwin Fey,...
ISCC
2003
IEEE
138views Communications» more  ISCC 2003»
14 years 3 months ago
Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies
Multimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in n...
Karol Kowalik, Martin Collier
ICRA
2009
IEEE
116views Robotics» more  ICRA 2009»
13 years 7 months ago
Multi-vehicle path coordination in support of communication
Abstract-- This paper presents a framework for generating time-optimal velocity profiles for a group of pathconstrained vehicle robots that have fixed and known initial and goal lo...
Pramod Abichandani, Hande Y. Benson, Moshe Kam
AINA
2008
IEEE
14 years 4 months ago
Optimal Resource Discovery Paths of Gnutella2
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...
Mikko Vapa, Annemari Auvinen, Yevgeniy Ivanchenko,...
INFOCOM
2003
IEEE
14 years 3 months ago
Measuring Bottleneck Bandwidth of Targeted Path Segments
Abstract— Accurate measurement of network bandwidth is crucial for network management applications as well as flexible Internet applications and protocols which actively manage ...
Khaled Harfoush, Azer Bestavros, John W. Byers