Sciweavers

3240 search results - page 116 / 648
» Pre-aggregation with probability distributions
Sort
View
ICTAI
2008
IEEE
14 years 4 months ago
Probabilistic Continuous Constraint Satisfaction Problems
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
Elsa Carvalho, Jorge Cruz, Pedro Barahona
ICC
2007
IEEE
14 years 4 months ago
Statistical Pruning for Near Maximum Likelihood Detection of MIMO Systems
Abstract— We show a statistical pruning approach for maximum likelihood (ML) detection of multiple-input multiple-output (MIMO) systems. We present a general pruning strategy for...
Tao Cui, Tracey Ho, Chintha Tellambura
ICDCSW
2006
IEEE
14 years 4 months ago
A directional gossip protocol for path discovery in MANETs
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
Roberto Beraldi
WWW
2005
ACM
14 years 3 months ago
Preferential walk: towards efficient and scalable search in unstructured peer-to-peer networks
To improve search efficiency and reduce unnecessary traffic in Peerto-Peer (P2P) networks, this paper proposes a trust-based probabilistic search algorithm, called preferential wa...
Hai Zhuge, Xue Chen, Xiaoping Sun
FORMATS
2004
Springer
14 years 3 months ago
Symbolic Model Checking for Probabilistic Timed Automata
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...