Results 11 to 20 of about 50 (44)
Journal of Mathematical Analysis and Applications, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
From Dynamic Programming to Bynamic Programming
Journal of Mathematical Analysis and Applications, 1993 The author suggests a new sequential optimization method called `bynamic programming', which includes dynamic programming as a special case. The objective function \(g(x,.)\) defined on \(X\times R^{\ell}\) is separable and at the same time nonincreasing or nondecreasing in the second variable for \(x\in X^ -\), \(x\in X^ +\) respectively, where \(X ...
openaire +2 more sources
Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics, 1976 openaire +3 more sources
Dynamic programming processes within dynamic programming processes
Journal of Mathematical Analysis and Applications, 1969 openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematics of Operations Research, 2018
We present a novel method for deriving tight Monte Carlo confidence intervals for solutions of stochastic dynamic programming equations. Taking some approximate solution to the equation as an input, we construct pathwise recursions with a known bias. Suitably coupling the recursions for lower and upper bounds ensures that the method is applicable even
Christian Bender +2 more
openaire +3 more sources
We present a novel method for deriving tight Monte Carlo confidence intervals for solutions of stochastic dynamic programming equations. Taking some approximate solution to the equation as an input, we construct pathwise recursions with a known bias. Suitably coupling the recursions for lower and upper bounds ensures that the method is applicable even
Christian Bender +2 more
openaire +3 more sources
Dynamic Programming Alignment Accuracy
Journal of Computational Biology, 1998Algorithms for generating alignments of biological sequences have inherent statistical limitations when it comes to the accuracy of the alignments they produce. Using simulations, we measure the accuracy of the standard global dynamic programming method and show that it can be reasonably well modelled by an "edge wander" approximation to the ...
I, Holmes, R, Durbin
openaire +2 more sources
Science, 1966
Little has been done in the study of these intriguing questions, and I do not wish to give the impression that any extensive set of ideas exists that could be called a "theory." What is quite surprising, as far as the histories of science and philosophy are concerned, is that the major impetus for the fantastic growth of interest in brain processes ...
openaire +2 more sources
Little has been done in the study of these intriguing questions, and I do not wish to give the impression that any extensive set of ideas exists that could be called a "theory." What is quite surprising, as far as the histories of science and philosophy are concerned, is that the major impetus for the fantastic growth of interest in brain processes ...
openaire +2 more sources
Management Science, 1975
Numerically valued reward processes are found in most dynamic programming models. Mitten, however, recently formulated finite horizon sequential decision processes in which a real-valued reward need not be earned at each stage. Instead of the cardinality assumption implicit in past models, Mitten assumes that a decision maker has a preference order ...
openaire +2 more sources
Numerically valued reward processes are found in most dynamic programming models. Mitten, however, recently formulated finite horizon sequential decision processes in which a real-valued reward need not be earned at each stage. Instead of the cardinality assumption implicit in past models, Mitten assumes that a decision maker has a preference order ...
openaire +2 more sources