Name
Abstract | ||
|---|---|---|
As many real applications need a large amount of states, the classical methods are intractable for solving large Markov Decision Processes. The decomposition technique basing on the topology of each state in the associated graph and the parallelization technique are very useful methods to cope with this problem. In this paper, the authors propose a Modified Value Iteration algorithm, adding the parallelism technique. They test their implementation on artificial data using an Open MP that offers a significant speed-up. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.4018/JECO.2015070104 | JECO |
Keywords | DocType | Volume |
Discounted Reward Criterion,Markov Decision Processes,Open MP,Parallelizing,Value Iteration Algorithm | Journal | 13 |
Issue | ISSN | Citations |
3 | 1539-2937 | 0 |
PageRank | References | Authors |
0.34 | 12 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sanaa Chafik | 1 | 1 | 1.70 |
| Cherki Daoui | 2 | 0 | 1.01 |