February 01, 1991 article Computationally Feasible Bounds for Partially Observed Markov Decision Processes Operations Research DOI: 10.1287/opre.39.1.162 OpenAlex Authors 0 Author list not loaded yet. Cited by 6 stored of 314 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Tools at the Frontiers of Quantitative Verification 2024 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 9 citations Gradient-Descent for Randomized Controllers Under Partial Observability 2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification 13 citations Under-Approximating Expected Total Rewards in POMDPs 2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 10 citations POMDP Controllers with Optimal Budget 2022 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification 0 citations The probabilistic model checker Storm 2021 International Journal on Software Tools for Technology Transfer article Computer Science Formal Methods in Verification Open access 246 citations Verification of Indefinite-Horizon POMDPs 2020 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 23 citations 6 results References 0