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...
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...
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...
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...
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...