Dvadsať rokov moderných metód vnútorného bodu
Dykstra's algorithm as the nonlinear extension of Bregman's optimization method.
Dynamic approach to optimum synthesis of a four-bar mechanism using a swarm intelligence algorithm
This paper presents a dynamic approach to the synthesis of a crank-rocker four-bar mechanism, that is obtained by an optimization problem and its solution using the swarm intelligence algorithm called Modified-Artificial Bee Colony (M-ABC). The proposed dynamic approach states a mono-objective dynamic optimization problem (MODOP), in order to obtain a set of optimal parameters of the system. In this MODOP, the kinematic and dynamic models of the whole system are consider as well as a set of constraints...
Dynamic family of multicommodity inventory problems.
Dynamic monetary risk measures for bounded discrete-time processes.
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 in constrained Markov decision processes
Dynamic programming with bivalent variables
Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy.
Dynamic Stochastic Accumulation Model With Application to Pension Savings Management
Dynamic traffic network equilibrium system.
Dynamical systems modelling of the interactions of animal stocking density and soil fertility in grazed pasture.
Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures
Soit U une fonction définie sur un ensemble fini E muni d'un noyau markovien irréductible M. L'objectif du papier est de comparer théoriquement deux procédures stochastiques de minimisation globale de U : le recuit simulé et un algorithme génétique. Pour ceci on se placera dans la situation idéalisée d'une infinité de particules disponibles et nous ferons une hypothèse commode d'existence de suffisamment de symétries du cadre (E,M,U). On verra notamment que contrairement au recuit simulé, toute...