Bibliografías temáticas / Dynamic programming / Artículos de revistas

Artículos de revistas sobre el tema "Dynamic programming"

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Dynamic programming.
Autor: Grafiati
Publicado: 4 de junio de 2021
Última modificación: 31 de julio de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Dynamic programming".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

O'Caoimh, C. C. y Moshe Sniedovich. "Dynamic Programming". Mathematical Gazette 77, n.º 479 (julio de 1993): 284. http://dx.doi.org/10.2307/3619755.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Smith, David K. y Moshe Sniedovich. "Dynamic Programming." Journal of the Operational Research Society 44, n.º 5 (mayo de 1993): 526. http://dx.doi.org/10.2307/2583920.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Smith, David K. "Dynamic Programming". Journal of the Operational Research Society 44, n.º 5 (mayo de 1993): 526–27. http://dx.doi.org/10.1057/jors.1993.90.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

Valqui Vidal, RenéVictor. "Dynamic programming". European Journal of Operational Research 71, n.º 1 (noviembre de 1993): 135–36. http://dx.doi.org/10.1016/0377-2217(93)90270-w.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

Kenea, Tadios Kiros. "Solving Shortest Route Using Dynamic Programming Problem". Indian Journal Of Science And Technology 15, n.º 31 (21 de agosto de 2022): 1527–31. http://dx.doi.org/10.17485/ijst/v15i31.1342.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Chow, Gregory C. "Dynamic optimization without dynamic programming". Economic Modelling 9, n.º 1 (enero de 1992): 3–9. http://dx.doi.org/10.1016/0264-9993(92)90002-j.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Lageweg, B. J., J. K. Lenstra, A. H. G. RinnooyKan, L. Stougie y A. H. G. Rinnooy Kan. "STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING". Statistica Neerlandica 39, n.º 2 (junio de 1985): 97–113. http://dx.doi.org/10.1111/j.1467-9574.1985.tb01131.x.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Iwamoto, S. "From Dynamic Programming to Bynamic Programming". Journal of Mathematical Analysis and Applications 177, n.º 1 (julio de 1993): 56–74. http://dx.doi.org/10.1006/jmaa.1993.1243.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Kaur, Kamaljeet y Neeti Taneja. "Dynamic Programming: LCS". International Journal of Advanced Research in Computer Science and Software Engineering 7, n.º 6 (30 de junio de 2017): 272–77. http://dx.doi.org/10.23956/ijarcsse/v7i6/0131.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Jdid, Maissam y Rafif Alhabib. "Neutrosophical dynamic programming". International Journal of Neutrosophic Science 18, n.º 3 (2022): 157–65. http://dx.doi.org/10.54216/ijns.1803013.

Texto completo
Resumen
The great development that science has witnessed in all fields has reduced the risks and losses resulting from undertaking any business or projects. Since the emergence of the science of operations research, many life issues have been addressed by relying on it, and by using its methods, we have been able to establish projects and businesses and use the available capabilities in an ideal manner. Which achieved great success in all areas and reduced the losses of all kinds, whether material or human, that we were exposed to because of carrying out these works or projects without prior study. We are now able to model, analyze and solve a wide range of problems that can be broken down into a set of partial problems using dynamic programming. Programming that is used to find the optimal solution in a multi-step situation that involves a set of related decisions. In this research, we study one of the operations research problems that are solved using dynamic programming. It is the problem of creating an expressway between two cities, using the neutrosophic logic. The logic that takes into account all the specific and non-specific data and takes into account all the circumstances that can face us during the implementation of the project. The goal of studying this issue is to determine the optimal total cost, which is related to the partial costs presented by the study prepared for this project. In order to avoid losses we will take the partial costs neutrosophic values of the form , where represents the minimum partial cost in stage and represents the upper limit of the partial cost in stage . Through the indeterminacy offered by neutrosophic logic, we are able to find the ideal solution that will bring us the lowest possible cost for constructing this expressway. It takes into account all the circumstances that may encounter us in our study, and we will present an applied example that illustrates the study.
Los estilos APA, Harvard, Vancouver, ISO, etc.
11

Iwamoto, Seiichi. "PRIMITIVE DYNAMIC PROGRAMMING". Bulletin of informatics and cybernetics 36 (diciembre de 2004): 163–72. http://dx.doi.org/10.5109/12585.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
12

Tsoi, Aleksander Alekseievitch. "Recurrent dynamic programming". Ciência e Natura 22, n.º 22 (11 de diciembre de 2000): 07. http://dx.doi.org/10.5902/2179460x27025.

Texto completo
Resumen
We developed the tchniques for immediate solution and optimization by parts for discrete nonlinear separable programming problem on the graph. These two techniques are based on the use of the dynamic programming method that results in obtaining one algorithm of dynamic programming built into another one. The both techniques make use of the graph structure. Multiple use of the decomposition is generalized in the frames of the hierarchically recurrent algorithm of dynamic programming.
Los estilos APA, Harvard, Vancouver, ISO, etc.
13

Lincoln, B. y A. Rantzer. "Relaxing Dynamic Programming". IEEE Transactions on Automatic Control 51, n.º 8 (agosto de 2006): 1249–60. http://dx.doi.org/10.1109/tac.2006.878720.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
14

Huang, S. H. S., Hongfei Liu y V. Viswanathan. "Parallel dynamic programming". IEEE Transactions on Parallel and Distributed Systems 5, n.º 3 (marzo de 1994): 326–28. http://dx.doi.org/10.1109/71.277784.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
15

Murray, J. J., C. J. Cox, G. G. Lendaris y R. Saeks. "Adaptive dynamic programming". IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews) 32, n.º 2 (mayo de 2002): 140–53. http://dx.doi.org/10.1109/tsmcc.2002.801727.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
16

Kossmann, Donald y Konrad Stocker. "Iterative dynamic programming". ACM Transactions on Database Systems 25, n.º 1 (marzo de 2000): 43–82. http://dx.doi.org/10.1145/352958.352982.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
17

Haskell, William B., Rahul Jain y Dileep Kalathil. "Empirical Dynamic Programming". Mathematics of Operations Research 41, n.º 2 (mayo de 2016): 402–29. http://dx.doi.org/10.1287/moor.2015.0733.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
18

Bender, Christian, Christian Gärtner y Nikolaus Schweizer. "Pathwise Dynamic Programming". Mathematics of Operations Research 43, n.º 3 (agosto de 2018): 965–95. http://dx.doi.org/10.1287/moor.2017.0891.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
19

Chudoung, Jerawan. "Iterative dynamic programming". Automatica 39, n.º 7 (julio de 2003): 1315–16. http://dx.doi.org/10.1016/s0005-1098(03)00079-7.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
20

Caminiti, Saverio, Irene Finocchi, Emanuele G. Fusco y Francesco Silvestri. "Resilient Dynamic Programming". Algorithmica 77, n.º 2 (13 de octubre de 2015): 389–425. http://dx.doi.org/10.1007/s00453-015-0073-z.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
21

Iyengar, Garud N. "Robust Dynamic Programming". Mathematics of Operations Research 30, n.º 2 (mayo de 2005): 257–80. http://dx.doi.org/10.1287/moor.1040.0129.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
22

Pardalos, Panos M. "Abstract dynamic programming". Optimization Methods and Software 29, n.º 3 (20 de noviembre de 2013): 671–72. http://dx.doi.org/10.1080/10556788.2013.858876.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
23

van Otterlo, Martijn. "Intensional dynamic programming. A Rosetta stone for structured dynamic programming". Journal of Algorithms 64, n.º 4 (octubre de 2009): 169–91. http://dx.doi.org/10.1016/j.jalgor.2009.04.004.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
24

Cai, Yongyang, Kenneth L. Judd, Thomas S. Lontzek, Valentina Michelangeli y Che-Lin Su. "A NONLINEAR PROGRAMMING METHOD FOR DYNAMIC PROGRAMMING". Macroeconomic Dynamics 21, n.º 2 (18 de enero de 2016): 336–61. http://dx.doi.org/10.1017/s1365100515000528.

Texto completo
Resumen
A nonlinear programming formulation is introduced to solve infinite-horizon dynamic programming problems. This extends the linear approach to dynamic programming by using ideas from approximation theory to approximate value functions. Our numerical results show that this nonlinear programming is efficient and accurate, and avoids inefficient discretization.
Los estilos APA, Harvard, Vancouver, ISO, etc.
25

Travers, D. L. y R. J. Kaye. "Dynamic dispatch by constructive dynamic programming". IEEE Transactions on Power Systems 13, n.º 1 (1998): 72–78. http://dx.doi.org/10.1109/59.651616.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
26

Karpov, D. A. y V. I. Struchenkov. "EFFECTIVE DYNAMIC PROGRAMMING ALGORITHMS". Vestnik komp'iuternykh i informatsionnykh tekhnologii, n.º 194 (agosto de 2020): 3–11. http://dx.doi.org/10.14489/vkit.2020.08.pp.003-011.

Texto completo
Resumen
This article is devoted to the analysis of the possibilities of increasing the speed of dynamic programming algorithms in solving applied problems of large dimension. Dynamic programming is considered rather than as an optimization method, but as a methodology that allows developing, from a single theoretical point of view, algorithms for solving problems that can be formalized in the form of multi-stage (multi-step) processes in which similar tasks are solved at all steps. It is shown that traditional dynamic programming algorithms based on preliminary setting of a regular grid of states are ineffective, especially if the parameters defining the states are not integer. The problems are considered, in the solution of which it is advisable to build a set of states in the process of counting, moving from one stage to another. Additional conditions are formulated that must be satisfied by the problem so that deliberately hopeless states do not fall into sets of states at each step. This ensures the rejection of not only the paths leading to each of the states, as in traditional dynamic programming algorithms, but also the unpromising states themselves, which greatly increases the efficiency of dynamic programming. Examples of applied problems are given, for the solution of which traditional dynamic programming algorithms were previously proposed, but which can be more efficiently solved by the proposed algorithm with state rejection. As applied to two-parameter problems, the concrete examples demonstrate the effectiveness of the algorithm with rejecting states in comparison with traditional algorithms, especially with increasing the dimension of the problem. An applied problem is considered, in the solution of which dynamic programming is used to construct recurrent formulas for calculating the optimal solution without enumerating options at all.
Los estilos APA, Harvard, Vancouver, ISO, etc.
27

Smith, Peter. "Dynamic Programming in Action". Journal of the Operational Research Society 40, n.º 9 (septiembre de 1989): 779. http://dx.doi.org/10.2307/2583059.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
28

Hisano, Hiroshi. "ON NONDETERMINISTIC DYNAMIC PROGRAMMING". Bulletin of informatics and cybernetics 40 (diciembre de 2008): 1–15. http://dx.doi.org/10.5109/18991.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
29

Eddy, Sean R. "What is dynamic programming?" Nature Biotechnology 22, n.º 7 (julio de 2004): 909–10. http://dx.doi.org/10.1038/nbt0704-909.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
30

Karpov, D. A. y V. I. Struchenkov. "EFFECTIVE DYNAMIC PROGRAMMING ALGORITHMS". Vestnik komp'iuternykh i informatsionnykh tekhnologii, n.º 194 (agosto de 2020): 3–11. http://dx.doi.org/10.14489/vkit.2020.08.pp.003-011.

Texto completo
Resumen
This article is devoted to the analysis of the possibilities of increasing the speed of dynamic programming algorithms in solving applied problems of large dimension. Dynamic programming is considered rather than as an optimization method, but as a methodology that allows developing, from a single theoretical point of view, algorithms for solving problems that can be formalized in the form of multi-stage (multi-step) processes in which similar tasks are solved at all steps. It is shown that traditional dynamic programming algorithms based on preliminary setting of a regular grid of states are ineffective, especially if the parameters defining the states are not integer. The problems are considered, in the solution of which it is advisable to build a set of states in the process of counting, moving from one stage to another. Additional conditions are formulated that must be satisfied by the problem so that deliberately hopeless states do not fall into sets of states at each step. This ensures the rejection of not only the paths leading to each of the states, as in traditional dynamic programming algorithms, but also the unpromising states themselves, which greatly increases the efficiency of dynamic programming. Examples of applied problems are given, for the solution of which traditional dynamic programming algorithms were previously proposed, but which can be more efficiently solved by the proposed algorithm with state rejection. As applied to two-parameter problems, the concrete examples demonstrate the effectiveness of the algorithm with rejecting states in comparison with traditional algorithms, especially with increasing the dimension of the problem. An applied problem is considered, in the solution of which dynamic programming is used to construct recurrent formulas for calculating the optimal solution without enumerating options at all.
Los estilos APA, Harvard, Vancouver, ISO, etc.
31

HOLMES, IAN y RICHARD DURBIN. "Dynamic Programming Alignment Accuracy". Journal of Computational Biology 5, n.º 3 (enero de 1998): 493–504. http://dx.doi.org/10.1089/cmb.1998.5.493.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
32

Bean, James C., John R. Birge y Robert L. Smith. "Aggregation in Dynamic Programming". Operations Research 35, n.º 2 (abril de 1987): 215–20. http://dx.doi.org/10.1287/opre.35.2.215.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
33

Kindermann, S. y A. Leitão. "Regularization by dynamic programming". Journal of Inverse and Ill-posed Problems 15, n.º 3 (junio de 2007): 295–310. http://dx.doi.org/10.1515/jiip.2007.016.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
34

Georghiou, Angelos, Angelos Tsoukalas y Wolfram Wiesemann. "Robust Dual Dynamic Programming". Operations Research 67, n.º 3 (mayo de 2019): 813–30. http://dx.doi.org/10.1287/opre.2018.1835.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
35

Nowakowski, Andrzej. "The dual dynamic programming". Proceedings of the American Mathematical Society 116, n.º 4 (1 de abril de 1992): 1089. http://dx.doi.org/10.1090/s0002-9939-1992-1102860-3.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
36

Smith, Peter. "Dynamic Programming in Action". Journal of the Operational Research Society 40, n.º 9 (septiembre de 1989): 779–87. http://dx.doi.org/10.1057/jors.1989.140.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
37

Sudderth, William D. "Finitely Additive Dynamic Programming". Mathematics of Operations Research 41, n.º 1 (febrero de 2016): 92–108. http://dx.doi.org/10.1287/moor.2015.0717.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
38

Feinberg, Eugene A. y Adam Shwartz. "Constrained Discounted Dynamic Programming". Mathematics of Operations Research 21, n.º 4 (noviembre de 1996): 922–45. http://dx.doi.org/10.1287/moor.21.4.922.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
39

Madievski, Anton G. y John B. Moore. "On Robust Dynamic Programming". IFAC Proceedings Volumes 29, n.º 1 (junio de 1996): 1715–20. http://dx.doi.org/10.1016/s1474-6670(17)57916-1.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
40

de Madrid, A. P., S. Dormido, F. Morilla y L. Grau. "Dynamic Programming Predictive Control". IFAC Proceedings Volumes 29, n.º 1 (junio de 1996): 1721–26. http://dx.doi.org/10.1016/s1474-6670(17)57917-3.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
41

Wu, Cang-pu. "Multicriteria Differential Dynamic Programming". IFAC Proceedings Volumes 20, n.º 9 (agosto de 1987): 431–36. http://dx.doi.org/10.1016/s1474-6670(17)55744-4.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
42

Deisenroth, Marc Peter, Carl Edward Rasmussen y Jan Peters. "Gaussian process dynamic programming". Neurocomputing 72, n.º 7-9 (marzo de 2009): 1508–24. http://dx.doi.org/10.1016/j.neucom.2008.12.019.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
43

Poch, Leslie A. y R. T. Jenkins. "4.4. Dynamic programming models". Energy 15, n.º 7-8 (julio de 1990): 573–81. http://dx.doi.org/10.1016/0360-5442(90)90006-n.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
44

Galewska, E. y A. Nowakowski. "Multidimensional Dual Dynamic Programming". Journal of Optimization Theory and Applications 124, n.º 1 (enero de 2005): 175–86. http://dx.doi.org/10.1007/s10957-004-6471-z.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
45

Wang, Chung-lie. "Dynamic programming and inequalities". Journal of Mathematical Analysis and Applications 150, n.º 2 (agosto de 1990): 528–50. http://dx.doi.org/10.1016/0022-247x(90)90121-u.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
46

Cotter, Kevin D. y Jee-Hyeong Park. "Non-concave dynamic programming". Economics Letters 90, n.º 1 (enero de 2006): 141–46. http://dx.doi.org/10.1016/j.econlet.2005.07.018.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
47

Cai, Yongyang y Kenneth L. Judd. "Shape-preserving dynamic programming". Mathematical Methods of Operations Research 77, n.º 3 (9 de septiembre de 2012): 407–21. http://dx.doi.org/10.1007/s00186-012-0406-5.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
48

Jalali, A. y M. J. Ferguson. "On distributed dynamic programming". IEEE Transactions on Automatic Control 37, n.º 5 (mayo de 1992): 685–89. http://dx.doi.org/10.1109/9.135517.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
49

ASANO, TAKAO. "DYNAMIC PROGRAMMING ON INTERVALS". International Journal of Computational Geometry & Applications 03, n.º 03 (septiembre de 1993): 323–30. http://dx.doi.org/10.1142/s0218195993000208.

Texto completo
Resumen
We 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 minimum weight dominating set of an interval graph G=(V, E), and an O(m log n) time algorithm for finding a maximum weight clique of a circular-arc graph G=(V, E), provided their intersection models of n intervals (arcs) are given.
Los estilos APA, Harvard, Vancouver, ISO, etc.
50

Eppstein, David, Zvi Galil, Raffaele Giancarlo y Giuseppe F. Italiano. "Sparse dynamic programming I". Journal of the ACM 39, n.º 3 (julio de 1992): 519–45. http://dx.doi.org/10.1145/146637.146650.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
También puede estar interesado en las bibliografías sobre el tema "Dynamic programming" para otros tipos de fuentes:
Tesis Libros
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía