Sciweavers

1336 search results - page 72 / 268
» SMTP Path Analysis
Sort
View
IPL
2002
80views more  IPL 2002»
15 years 1 months ago
A note on models for non-probabilistic analysis of packet switching networks
We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types...
Adi Rosén
ECRTS
2004
IEEE
15 years 5 months ago
Static Determination of Probabilistic Execution Times
Most previous research done in probabilistic schedulability analysis assumes a known distribution of execution times for each task of a real-time application. This is however not ...
Laurent David, Isabelle Puaut
ICFEM
2000
Springer
15 years 5 months ago
Formal Treatment of a Family of Fixed-Point Problems on Graphs by CafeOBJ
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
Tetsuo Tamai
ICPR
2006
IEEE
16 years 2 months ago
Geodesic Curves for Analysis of Continuous Implicit Shapes
A method is proposed for performing shape analysis of m-surfaces, e.g. planar curves and surfaces, with a geometric interpretation. The analysis uses an implicit surface represent...
Jan Erik Solem
TIT
2010
98views Education» more  TIT 2010»
14 years 8 months ago
Pairwise intersession network coding on directed networks
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...
Chih-Chun Wang, Ness B. Shroff