Sciweavers

872 search results - page 97 / 175
» Extreme lower probabilities
Sort
View
108
Voted
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 23 days ago
On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model
Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under sm...
K. Prasad, B. Sundar Rajan
78
Voted
CORR
2010
Springer
76views Education» more  CORR 2010»
15 years 23 days ago
An analysis of a war-like card game
In his book "Mathematical Mind-Benders", Peter Winkler poses the following open problem, originally due to the first author: "[In the game Peer Pressure,] two player...
Boris Alexeev, Jacob Tsimerman
CORR
2010
Springer
69views Education» more  CORR 2010»
15 years 23 days ago
Epistemic irrelevance in credal nets: the case of imprecise Markov trees
We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal ne...
Gert de Cooman, Filip Hermans, Alessandro Antonucc...
126
Voted
CN
2006
82views more  CN 2006»
15 years 21 days ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
102
Voted
COR
2006
140views more  COR 2006»
15 years 21 days ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell