Detail
Raw data [ X ]
<section name="raw"> <SEQUENTIAL> <record key="001" att1="001" value="IHS101251208" att2="IHS101251208">001 IHS101251208</record> <field key="037" subkey="x">englisch</field> <field key="050" subkey="x">Buch</field> <field key="076" subkey="">Formalwissenschaft</field> <field key="100" subkey="">hinderer, k.</field> <field key="331" subkey="">foundations of non-stationary dynamic programming with discrete time parameter</field> <field key="403" subkey="">1. ed.</field> <field key="410" subkey="">berlin, heidelberg, new york</field> <field key="412" subkey="">springer-verlag</field> <field key="425" subkey="">1970</field> <field key="433" subkey="">vi, 160 pp.</field> <field key="451" subkey="">lecture notes in operations research and mathematical systems; 33</field> <field key="451" subkey="h">beckmann, m. (ed.) ; kuenzi, h.p. (ed.)</field> <field key="461" subkey="">economics, computer science, information and control</field> <field key="517" subkey="c">from the table of contents: introduction and summary; countable state space: decision models and definition of the problem; the</field> <field key="pri" subkey="n">ciple of optimality and the optimality equation; value iteration; criteria of optimality and existence of p-optimal plans;</field> <field key="suf" subkey="f">icient statistics, markovian and stationary models; models with incomplete information; examples of special models;</field> <field key="ran" subkey="d">omized plans; dynamic programming under uncertainty; general state space: decision models; measure-theoretic and topological</field> <field key="pre" subkey="p">arations; universal measurability of the maximal conditional expected reward; the optimality equation; substitution of</field> <field key="ran" subkey="d">omized plans by deterministic plans; a generalization of the fixed point theorem for contractions; criteria of optimality and</field> <field key="exi" subkey="s">tence of p-optimal plans; sufficient statistics, markovian and stationary models; validity of the optimality equation without</field> <field key="top" subkey="o">logical assumptions on state space and action space; supplementary remarks: notions of optimality; some results for general</field> <field key="set" subkey="s">of admissible plans; a short summary of results of stochastic dynamic programming not treated in the present work; appendix;</field> <field key="544" subkey="">4566-B</field> </SEQUENTIAL> </section> Servertime: 0.078 sec | Clienttime:
sec
|