Sciweavers

160 search results - page 12 / 32
» Information state for Markov decision processes with network...
Sort
View
ICASSP
2008
IEEE
14 years 1 months ago
Link throughput of multi-channel opportunistic access with limited sensing
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...
Keqin Liu, Qing Zhao
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 21 days ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...
APIN
2004
107views more  APIN 2004»
13 years 7 months ago
Designing Polymer Blends Using Neural Networks, Genetic Algorithms, and Markov Chains
In this paper we present a new technique to simulate polymer blends that overcomes the shortcomings in polymer system modeling. This method has an inherent advantage in that the v...
N. K. Roy, Walter D. Potter, D. P. Landau
ICC
2008
IEEE
169views Communications» more  ICC 2008»
14 years 1 months ago
Optimality of Myopic Sensing in Multi-Channel Opportunistic Access
—We consider opportunistic communications over multiple channels where the state (“good” or “bad”) of each channel evolves as independent and identically distributed Mark...
Tara Javidi, Bhaskar Krishnamachari, Qing Zhao, Mi...
CDC
2008
IEEE
184views Control Systems» more  CDC 2008»
14 years 1 months ago
Almost sure convergence to consensus in Markovian random graphs
— In this paper we discuss the consensus problem for a network of dynamic agents with undirected information flow and random switching topologies. The switching is determined by...
Ion Matei, Nuno C. Martins, John S. Baras