Sciweavers

2796 search results - page 278 / 560
» The coolest path problem
Sort
View
INFOCOM
2009
IEEE
16 years 1 months ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
INFOCOM
2009
IEEE
16 years 1 months ago
Diverse Routing in Networks with Probabilistic Failures
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
Hyang-Won Lee, Eytan Modiano
AIME
2009
Springer
16 years 1 months ago
An Ontology for the Care of the Elder at Home
The care of the elder at home is highly demanded in modern societies. It is based on the difficult task of coordinating multiple professionals and procedures acting on the same pa...
David Riaño, Francis Real, Fabio Campana, S...
ESWS
2009
Springer
16 years 1 months ago
Ranking Approximate Answers to Semantic Web Queries
We consider the problem of a user querying semistructured data such as RDF without knowing its structure. In these circumstances, it is helpful if the querying system can perform a...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
FM
2009
Springer
124views Formal Methods» more  FM 2009»
16 years 1 months ago
An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method
We present a novel approach to optimize scope-bounded checking programs using a relational constraint solver. Given a program and its correctness specification, the traditional app...
Danhua Shao, Sarfraz Khurshid, Dewayne E. Perry