Results 161 to 170 of about 3,744,840 (204)
Some of the next articles are maybe not open access.
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
Dynamic programming on intervals
International Journal of Computational Geometry & Applications, 1991We consider problems on intervals which can be solved by dynamic programming. Specifically, we give an efficient implementation of dynamic programming on intervals. As an application, an optimal sequential partition of a graph G=(V, E) can be obtained in O(m log n) time, where n=|V| and m=|E|. We also present an O(n log n) time algorithm for finding a
openaire +2 more sources
On Bounds for Dynamic Programs
Mathematics of Operations Research, 1985An operator theoretical model is used to provide a general framework for establishing bounds in dynamic programming by extrapolation methods. A set of bounds is found for a specified solution V of an operator equation v = Uv with an isotone operator U, containing many known bounds as a special case by applying the general setting to standard models (e.
openaire +3 more sources
2013
Independent scoring of the aligned sections to determine the quality of biological sequence alignments enables recursive definitions of the overall alignment score. This property is not only biologically meaningful but it also provides the opportunity to find the optimal alignments using dynamic programming-based algorithms.
openaire +2 more sources
Independent scoring of the aligned sections to determine the quality of biological sequence alignments enables recursive definitions of the overall alignment score. This property is not only biologically meaningful but it also provides the opportunity to find the optimal alignments using dynamic programming-based algorithms.
openaire +2 more sources
Dynamic Programming by Exchangeability
SIAM Journal on Computing, 1989Let \(X_ 1,X_ 2,X_ 3,..\). be a discrete stochastic process with a stopping time N. Our goal is to compute \(E[p(X_ 1,X_ 2,...,X_ N)]\) for some payoff function p by computational methods more efficient than exhaustive search. The author introduces dynamic exchangeable programming as an approach which is applicable over a process of exchangeable random
openaire +3 more sources
IEEE Transactions on Automatic Control, 2006
The idea of dynamic programming is general and very simple, but the "curse of dimensionality" is often prohibitive and restricts the fields of application. This paper introduces a method to reduce the complexity by relaxing the demand for optimality. The distance from optimality is kept within prespecified bounds and the size of the bounds determines ...
Bo Lincoln, Anders Rantzer
openaire +2 more sources
The idea of dynamic programming is general and very simple, but the "curse of dimensionality" is often prohibitive and restricts the fields of application. This paper introduces a method to reduce the complexity by relaxing the demand for optimality. The distance from optimality is kept within prespecified bounds and the size of the bounds determines ...
Bo Lincoln, Anders Rantzer
openaire +2 more sources
Approximations of Dynamic Programs, II
Mathematics of Operations Research, 1978This paper extends a procedure for approximating dynamic programs due to Fox (Fox, B. L. 1971. Finite-state approximations to denumerable-state dynamic programs. J. Math. Anal. Appl. 34 665–670.). Here, the monotone contraction operator model of Denardo (Denardo, E. V. 1967. Contraction mappings in the theory underlying dynamic programming.
openaire +3 more sources
1989
We are pleading for system builders to pay attention to the experience of so many novice users, and help in the provision of a problem solving environment if it is not possible to provide automatic improvements. The difficulty of using algebra systems is not just because of bad design, but is intrinsic to them.
P. D. Pearce, John P. Fitch
openaire +1 more source
We are pleading for system builders to pay attention to the experience of so many novice users, and help in the provision of a problem solving environment if it is not possible to provide automatic improvements. The difficulty of using algebra systems is not just because of bad design, but is intrinsic to them.
P. D. Pearce, John P. Fitch
openaire +1 more source
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
1993 Conference on Software Maintenance, 2002
Program dicing, introduced by J. R. Lyle and M. Weiser (Proc. 2nd Int. Conf. Comput. Appl., pp. 887-883, 1987), is a debugging technique built upon program slicing. Their dicing methodology is referred to as static program dicing in this paper. Since it is difficult to apply static program dicing effectively under some circumstances, an extension of ...
T. Y. Chen, Y. Y. Cheung
openaire +1 more source
Program dicing, introduced by J. R. Lyle and M. Weiser (Proc. 2nd Int. Conf. Comput. Appl., pp. 887-883, 1987), is a debugging technique built upon program slicing. Their dicing methodology is referred to as static program dicing in this paper. Since it is difficult to apply static program dicing effectively under some circumstances, an extension of ...
T. Y. Chen, Y. Y. Cheung
openaire +1 more source