Sciweavers

297 search results - page 10 / 60
» J-MADeM, a market-based model for complex decision problems
Sort
View
JAIR
2000
152views more  JAIR 2000»
13 years 7 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 4 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
VMCAI
2010
Springer
14 years 4 months ago
Complexity Bounds for the Verification of Real-Time Software
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahe...
KBS
2006
117views more  KBS 2006»
13 years 7 months ago
Risk and confidence analysis for fuzzy multicriteria decision making
Recent research has recognised that multicriteria decision making (MCDM) should take account of uncertainty, risk and confidence. This paper takes this research forward by using l...
Norman E. Fenton, Wei Wang
SOCO
2010
Springer
13 years 2 months ago
Using evolution strategies to solve DEC-POMDP problems
Decentralized partially observable Markov decision process (DEC-POMDP) is an approach to model multi-robot decision making problems under uncertainty. Since it is NEXP-complete the...
Baris Eker, H. Levent Akin