Gotowe bibliografie tematyczne / Dynamic programming / Artykuły w czasopismach

Artykuły w czasopismach na temat „Dynamic programming”

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Dynamic programming.
Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 31 lipca 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Dynamic programming”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

O'Caoimh, C. C., i Moshe Sniedovich. "Dynamic Programming". Mathematical Gazette 77, nr 479 (lipiec 1993): 284. http://dx.doi.org/10.2307/3619755.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Smith, David K., i Moshe Sniedovich. "Dynamic Programming." Journal of the Operational Research Society 44, nr 5 (maj 1993): 526. http://dx.doi.org/10.2307/2583920.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Kaur, Kamaljeet, i Neeti Taneja. "Dynamic Programming: LCS". International Journal of Advanced Research in Computer Science and Software Engineering 7, nr 6 (30.06.2017): 272–77. http://dx.doi.org/10.23956/ijarcsse/v7i6/0131.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
11

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
12

Tsoi, Aleksander Alekseievitch. "Recurrent dynamic programming". Ciência e Natura 22, nr 22 (11.12.2000): 07. http://dx.doi.org/10.5902/2179460x27025.

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
13

Lincoln, B., i A. Rantzer. "Relaxing Dynamic Programming". IEEE Transactions on Automatic Control 51, nr 8 (sierpień 2006): 1249–60. http://dx.doi.org/10.1109/tac.2006.878720.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
14

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
15

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
16

Kossmann, Donald, i Konrad Stocker. "Iterative dynamic programming". ACM Transactions on Database Systems 25, nr 1 (marzec 2000): 43–82. http://dx.doi.org/10.1145/352958.352982.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
17

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
18

Bender, Christian, Christian Gärtner i Nikolaus Schweizer. "Pathwise Dynamic Programming". Mathematics of Operations Research 43, nr 3 (sierpień 2018): 965–95. http://dx.doi.org/10.1287/moor.2017.0891.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
19

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
20

Caminiti, Saverio, Irene Finocchi, Emanuele G. Fusco i Francesco Silvestri. "Resilient Dynamic Programming". Algorithmica 77, nr 2 (13.10.2015): 389–425. http://dx.doi.org/10.1007/s00453-015-0073-z.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
21

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
22

Pardalos, Panos M. "Abstract dynamic programming". Optimization Methods and Software 29, nr 3 (20.11.2013): 671–72. http://dx.doi.org/10.1080/10556788.2013.858876.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
23

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
24

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
25

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
26

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
27

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
28

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
29

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
30

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
31

HOLMES, IAN, i RICHARD DURBIN. "Dynamic Programming Alignment Accuracy". Journal of Computational Biology 5, nr 3 (styczeń 1998): 493–504. http://dx.doi.org/10.1089/cmb.1998.5.493.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
32

Bean, James C., John R. Birge i Robert L. Smith. "Aggregation in Dynamic Programming". Operations Research 35, nr 2 (kwiecień 1987): 215–20. http://dx.doi.org/10.1287/opre.35.2.215.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
33

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
34

Georghiou, Angelos, Angelos Tsoukalas i Wolfram Wiesemann. "Robust Dual Dynamic Programming". Operations Research 67, nr 3 (maj 2019): 813–30. http://dx.doi.org/10.1287/opre.2018.1835.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
35

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
36

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
37

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
38

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
39

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
40

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
41

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
42

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
43

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
44

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
45

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
46

Cotter, Kevin D., i Jee-Hyeong Park. "Non-concave dynamic programming". Economics Letters 90, nr 1 (styczeń 2006): 141–46. http://dx.doi.org/10.1016/j.econlet.2005.07.018.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
47

Cai, Yongyang, i Kenneth L. Judd. "Shape-preserving dynamic programming". Mathematical Methods of Operations Research 77, nr 3 (9.09.2012): 407–21. http://dx.doi.org/10.1007/s00186-012-0406-5.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
48

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
49

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
50

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany bibliografiami na temat „Dynamic programming” dla innych typów źródeł:
Rozprawy doktorskie Książki
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii