Sciweavers

2005 search results - page 299 / 401
» Decisive Markov Chains
Sort
View
109
Voted
IANDC
2010
116views more  IANDC 2010»
15 years 1 days ago
Weak bisimulation is sound and complete for pCTL*
Abstract. We investigate weak bisimulation of probabilistic systems in the presence of nondeterminism, i.e. labelled concurrent Markov chains (LCMC) with silent transitions. We bui...
Josée Desharnais, Vineet Gupta, Radha Jagad...
INFOCOM
2010
IEEE
14 years 12 months ago
Queuing Analysis in Multichannel Cognitive Spectrum Access: A Large Deviation Approach
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each prima...
Amine Laourine, Shiyao Chen, Lang Tong
INFOCOM
2010
IEEE
14 years 12 months ago
Joint Random Access and Power Selection for Maximal Throughput in Wireless Networks
—In wireless networks, how to select transmit power that maximizes throughput is a challenging problem. On one hand, transmissions at a high power level could increase interferen...
Yan Gao, Zheng Zeng, P. R. Kumar
IPL
2010
112views more  IPL 2010»
14 years 12 months ago
The cost of probabilistic agreement in oblivious robot networks
In this paper, we look at the time complexity of two agreement problems in networks of oblivious mobile robots, namely, at the gathering and scattering problems. Given a set of ro...
Julien Clement, Xavier Défago, Maria Gradin...
JCST
2010
139views more  JCST 2010»
14 years 12 months ago
Dirichlet Process Gaussian Mixture Models: Choice of the Base Distribution
In the Bayesian mixture modeling framework it is possible to infer the necessary number of components to model the data and therefore it is unnecessary to explicitly restrict the n...
Dilan Görür, Carl Edward Rasmussen