All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3 Next

Displaying 41 – 60 of 124

Showing per page

Deterministic state-constrained optimal control problems without controllability assumptions

Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidani (2011)

ESAIM: Control, Optimisation and Calculus of Variations

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

Olivier Bokanowski, Nicolas Forcadel, Hasnaa Zidani (2011)

ESAIM: Control, Optimisation and Calculus of Variations

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...

Dynamic programming for reduced NFAs for approximate string and sequence matching

Jan Holub (2002)

Kybernetika

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,...

Equilibrium search model with endogenous growth rate of human capital

Wansheng Tang, Chi Zhou, Chaoqun Xiao, Ruiqing Zhao (2016)

Kybernetika

This article studies an equilibrium search problem when jobs provided by firms can be either unskilled or skilled and when workers differing in their education level can be either low-educated or high-educated. The structure proportion of jobs affects the equilibrium which indicates a threshold that can distinguish whether the equilibrium is separating or cross-skill. In addition, the cross-skill equilibrium solution implies the high-educated workers are more likely to obtain higher pay rates than...

Erlang distributed activity times in stochastic activity networks

Yousry H. Abdelkader (2003)

Kybernetika

It is assumed that activity times in stochastic activity networks (SANs) are independent Erlang random variable (r.v.). A recurrence method of determining the k th moments of the completion time is presented. Applications are provided for illustration and are used to evaluate the applicability and appropriateness of the Erlang model to represent activity network.

Currently displaying 41 – 60 of 124