𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Most Relevant Explanation: computational complexity and approximation methods

✍ Scribed by Changhe Yuan; Heejin Lim; Michael L. Littman

Publisher
Springer Netherlands
Year
2011
Tongue
English
Weight
412 KB
Volume
61
Category
Article
ISSN
1012-2443

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bayesian methods in cost–effectiveness s
Bayesian methods in cost–effectiveness studies: objectivity, computation and other relevant aspects
✍ C. Armero; G. García-Donato; A. López-Quílez 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

## Abstract In a probabilistic sensitivity analysis (PSA) of a cost–effectiveness (CE) study, the unknown parameters are considered as random variables. A crucial question is what probabilistic distribution is suitable for synthesizing the available information (mainly data from clinical trials) ab

Computational complexity of planning and
Computational complexity of planning and approximate planning in the presence of incompleteness
✍ Chitta Baral; Vladik Kreinovich; Raúl Trejo 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 213 KB

In the last several years, there have been several studies about the computational complexity of classical planning assuming that the planner has complete knowledge about the initial situation. Recently, there have been proposals to use 'sensing' actions to plan in the presence of incompleteness. In

Approximating functions by means of symb
Approximating functions by means of symbolic computation and a general extrapolation method
✍ J. Grotendorst 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Using a general extrapolation algorithm we present MAPLE procedures for the generation of polynomial and rational approximations to functions having formal series expansions. This algorithm, which has been called E algorithm or Brezinski-Hâvie (BH) protocol, includes most of the series (sequence) tr