Results 261 to 270 of about 3,942,699 (304)
Some of the next articles are maybe not open access.
Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990, 1994
Recurrence formulations for various problems, such as finding an optimal order of matrix multiplication, finding an optimal binary search tree, and optimal triangulation of polygons, assume a similar form. A. Gibbons and W. Rytter (1988) gave a CREW PRAM algorithm to solve such dynamic programming problems.
Shou-Hsuan Stephen Huang +2 more
openaire +3 more sources
Recurrence formulations for various problems, such as finding an optimal order of matrix multiplication, finding an optimal binary search tree, and optimal triangulation of polygons, assume a similar form. A. Gibbons and W. Rytter (1988) gave a CREW PRAM algorithm to solve such dynamic programming problems.
Shou-Hsuan Stephen Huang +2 more
openaire +3 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
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
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
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
Dynamic Programming by Exchangeability
SIAM Journal on Computing, 1989This article introduces the concept of exchangeable stopping time and a technique of dynamic programming based upon this concept for fast computation of the expected Value of a payoff function upon stopping. One instance of an exchangeable stopping time is when a stopping time is defined by a threshold on the sequential sum of the process.
openaire +3 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. SIAM Rev. 9
openaire +3 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
The dynamic behavior of programs
Proceedings of the December 9-11, 1968, fall joint computer conference, part II on - AFIPS '68 (Fall, part II), 1968A computer system consists of several resources for which users' programs are competing: CPU time, primary and secondary storage and Input-Output devices. More and more computer systems, which are being marketed currently, allow for resource sharing among several jobs, in order to obtain a better utilization of all available equipment, or to provide ...
openaire +2 more sources