✦ LIBER ✦

On the undecidability of probabilistic planning and related stochastic optimization problems

✍ Scribed by Omid Madani; Steve Hanks; Anne Condon

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 281 KB
Volume: 147
Category: Article
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(02)00378-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the stochastic sequential and non-seq

On the stochastic sequential and non-sequential production planning problem

✍ Shivaji Rao 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 78 KB

Solution of the problem of synthesizing

Solution of the problem of synthesizing a stochastic optimal control using non-linear probabilistic criteria

✍ S.V. Sokolov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 314 KB

A method that enabl~ control laws for non-linear stochastic objects to be synthesized exactly is considered. "I'ne control is optimal in the sense of probabiListic criteria of a general form. The advantages of the method over the traditional methods are demom~ted and an example of its practical appl

Combinatorial optimization problems in t

Combinatorial optimization problems in the analysis and design of probabilistic networks

✍ D. Bauer; F. Boesch; C. Suffel; R. Tindell 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

This paper presents some results regarding the design of reliable networks. The problem under consideration involves networks which are undirected graphs having equal and independent edge failure probabilities. The index of reliability is the probability that the network fails (becomes disconnected)

On approximability of linear ordering an

On approximability of linear ordering and related NP-optimization problems on graphs

✍ Sounaka Mishra; Kripasindhu Sikdar 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 337 KB

We investigate the approximability of minimum and maximum linear ordering problems (MIN-LOP and MAX-LOP) and related feedback set problems such as maximum weight acyclic subdiagraph (MAX-W-SUBDAG), minimum weight feedback arc/vertex set (MIN-W-FAS/ MIN-W-FVS) and a generalization of the latter calle

On Approximability of Linear Ordering an

On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)

✍ Sounaka Mishra; Kripasindhu Sikdar 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 297 KB

On the approximability of clique and rel

On the approximability of clique and related maximization problems

✍ Aravind Srinivasan 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 247 KB

We consider approximations of the form n 1Àoð1Þ for the Maximum Clique problem, where n is the number of vertices in the input graph and where the ''oð1Þ'' term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability re