Decomposable non-negative matrices in a dynamic programming problem
Der diskontierte Einarmige Bandit.
Determination of Optimum Signal Plan Sequences in a Traffic Control System: Method and Results
Deterministic state-constrained optimal control problems without controllability assumptions
In the present paper, we consider nonlinear optimal control problems with constraints on the state of the system. We are interested in the characterization of the value function without any controllability assumption. In the unconstrained case, it is possible to derive a characterization of the value function by means of a Hamilton-Jacobi-Bellman (HJB) equation. This equation expresses the behavior of the value function along the trajectories arriving or starting from any position x. In the constrained...
Deterministic state-constrained optimal control problems without controllability assumptions
In the present paper, we consider nonlinear optimal control problems with constraints on the state of the system. We are interested in the characterization of the value function without any controllability assumption. In the unconstrained case, it is possible to derive a characterization of the value function by means of a Hamilton-Jacobi-Bellman (HJB) equation. This equation expresses the behavior of the value function along the trajectories arriving or starting from any position x. In...
Deux problèmes d'affectation non linéaires
Discounted dynamic programming on Euclidean spaces
Discrete stochastic dynamics of income inequality in education: An applied stochastic model and a case study.
Diskrétní úlohy dynamického programování
Dynamic optimal cooling control for continuous casting of steel
Dynamic Programming: an overview
Dynamic programming and mean-variance hedging in discrete time.
Dynamic programming as optimal path problem in weighted digraphs.
Dynamic programming for reduced NFAs for approximate string and sequence matching
searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given integer,...
Dynamic programming with bivalent variables
Dynamic Stochastic Accumulation Model With Application to Pension Savings Management