Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009): Difference between revisions
From MaRDI portal
EloiFerrer (talk | contribs) Page on [mardi] deleted: Publication:1641009 |
EloiFerrer (talk | contribs) Merged Item from Q3449475 |
||||||||||||||
| aliases / en / 0 | aliases / en / 0 | ||||||||||||||
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes | |||||||||||||||
| description / en | description / en | ||||||||||||||
scientific article; zbMATH DE number 6504590 | |||||||||||||||
| Property / title | |||||||||||||||
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (English) | |||||||||||||||
| Property / title: Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Open document ID | |||||||||||||||
| Property / zbMATH Open document ID: 1394.60084 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / DOI | |||||||||||||||
| Property / DOI: 10.1007/978-3-662-47666-6_15 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / published in | |||||||||||||||
| Property / published in: Automata, Languages, and Programming / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / publication date | |||||||||||||||
4 November 2015
| |||||||||||||||
| Property / publication date: 4 November 2015 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH DE Number | |||||||||||||||
| Property / zbMATH DE Number: 6504590 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
probabilistic polynomial system | |||||||||||||||
| Property / zbMATH Keywords: probabilistic polynomial system / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / zbMATH Keywords | |||||||||||||||
Bellman optimality | |||||||||||||||
| Property / zbMATH Keywords: Bellman optimality / rank | |||||||||||||||
Normal rank | |||||||||||||||
| Property / OpenAlex ID | |||||||||||||||
| Property / OpenAlex ID: W2964007666 / rank | |||||||||||||||
Normal rank | |||||||||||||||
| links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 09:14, 6 May 2024
scientific article; zbMATH DE number 6504590
- Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes |
scientific article; zbMATH DE number 6504590 |
|
Statements
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (English)
0 references
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (English)
0 references
14 June 2018
0 references
4 November 2015
0 references
branching Markov decision processes
0 references
greatest fixed point
0 references
Bellman optimality equations
0 references
probabilistic polynomial system
0 references
Bellman optimality
0 references
