Sciweavers

1336 search results - page 51 / 268
» SMTP Path Analysis
Sort
View
QSHINE
2005
IEEE
14 years 2 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
ICNP
2003
IEEE
14 years 2 months ago
On the Cost-Quality Tradeoff in Topology-Aware Overlay Path Probing
Path probing is essential to maintaining an efficient overlay network topology. However, the cost of a full-scale probing is as high as ¢¤£¦¥¨§© , which is prohibitive i...
Chiping Tang, Philip K. McKinley
DAC
1994
ACM
14 years 1 months ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah
NETWORKING
2007
13 years 10 months ago
Measuring Bandwidth Signatures of Network Paths
In this paper, we propose a practical and efficient technique, Forecaster, to estimate (1) the end-to-end available bandwidth, and (2) the speed of the most congested (tight) link ...
Mradula Neginhal, Khaled Harfoush, Harry G. Perros
AR
2007
103views more  AR 2007»
13 years 8 months ago
Stability of autonomous vehicle path tracking with pure delays in the control loop
This paper presents a new method to analyze the stability of a general class of mobile robot path tracking algorithms taking into account explicitly the computation and communicat...
Guillermo Heredia, Aníbal Ollero