Sciweavers

2990 search results - page 380 / 598
» Hidden Markov processes
Sort
View
DSN
2008
IEEE
16 years 1 months ago
A recurrence-relation-based reward model for performability evaluation of embedded systems
Embedded systems for closed-loop applications often behave as discrete-time semi-Markov processes (DTSMPs). Performability measures most meaningful to iterative embedded systems, ...
Ann T. Tai, Kam S. Tso, William H. Sanders
IPPS
2008
IEEE
16 years 1 months ago
Reducing the run-time of MCMC programs by multithreading on SMP architectures
The increasing availability of multi-core and multiprocessor architectures provides new opportunities for improving the performance of many computer simulations. Markov Chain Mont...
Jonathan M. R. Byrd, Stephen A. Jarvis, A. H. Bhal...
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 6 months ago
Approaching Throughput-optimality in Distributed CSMA Scheduling Algorithms with Collisions
Abstract--It was shown recently that carrier sense multiple access (CSMA)-like distributed algorithms can achieve the maximal throughput in wireless networks (and task processing n...
Libin Jiang, Jean C. Walrand
AMAI
2006
Springer
15 years 6 months ago
Symmetric approximate linear programming for factored MDPs with application to constrained problems
A weakness of classical Markov decision processes (MDPs) is that they scale very poorly due to the flat state-space representation. Factored MDPs address this representational pro...
Dmitri A. Dolgov, Edmund H. Durfee
JAIR
2008
145views more  JAIR 2008»
15 years 6 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein