𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Structured markovian decision problems

✍ Scribed by Basil A. Kalymon

Publisher
John Wiley and Sons
Year
1973
Tongue
English
Weight
577 KB
Volume
20
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic decision problem structuring
Dynamic decision problem structuring
✍ James Corner; John Buchanan; Mordecai Henig 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB

## Abstract This paper develops a conceptualization of decision problem structuring which synthesizes a number of models and approaches cited in the decision‐making literature in general and the multi‐criteria literature in particular. The approach advocates a dynamic interaction between criteria a

Decision Problems for Patterns
Decision Problems for Patterns
✍ T. Jiang; A. Salomaa; K. Salomaa; S. Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 742 KB

We settle an open problem, the inclusion problem for pattern languages. This is the first known case where inclusion is undecidable for generative devices having a trivially decidable equivalence problem. The study of patterns goes back to the seminal work of Thue and is important also, for instance

Special Issue: Solving Irregularly Struc
Special Issue: Solving Irregularly Structured Problems
✍ Yang, Tao 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 22 KB

## Solving Irregularly Structured Problems Efficient parallel solutions have been found to many problems. However, there still exists a large class of problems, known as irregularly structured problems, that lack efficient solutions and systems support. This issue is devoted to solving irregularly

Solution of continuous-time markovian de
Solution of continuous-time markovian decision models using infinite linear programming
✍ Prasadarao Kakumanu 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

## Abstract Infinite‐horizon, countable‐state, continuous‐time Markovian decision models are solved by formulating as a pair of infinite linear‐programming problems. Expected discounted and average returns are considered as criterion functions. For both criterion functions, the existence of determi