Sciweavers

41 search results - page 6 / 9
» Compact routing with name independence
Sort
View
MICAI
2007
Springer
14 years 1 months ago
Optimizing Inference in Bayesian Networks and Semiring Valuation Algebras
Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In th...
Michael Wachter, Rolf Haenni, Marc Pouly
WSNA
2003
ACM
14 years 21 days ago
Parametric probabilistic sensor network routing
Motivated by realistic sensor network scenarios that have mis-informed nodes and variable network topologies, we propose a fundamentally different approach to routing that combine...
Christopher L. Barrett, Stephan Eidenbenz, Lukas K...
WIMOB
2008
IEEE
14 years 1 months ago
AVERT: Adaptive SerVicE and Route Discovery ProTocol for MANETs
—In the past few years there has been increasing research interest in service discovery protocols for Mobile Ad Hoc Networks (MANET). The most promising approaches so far address...
Christopher N. Ververidis, George C. Polyzos
HUC
2004
Springer
14 years 25 days ago
Opportunity Knocks: A System to Provide Cognitive Assistance with Transportation Services
We present an automated transportation routing system, called “Opportunity Knocks,” whose goal is to improve the efficiency, safety and independence of individuals with mild co...
Donald J. Patterson, Lin Liao, Krzysztof Gajos, Mi...
LCN
2002
IEEE
14 years 11 days ago
Controlled Multicast Framework
The IP multicast has not been widely used by current internet service operators, and part of this relates to the nature of multicast, which is designed to allow any host to receiv...
Rami Lehtonen, Jarmo Harju