Gotowe bibliografie tematyczne / Dynamic programming

Gotowa bibliografia na temat „Dynamic programming”

Autor: Grafiati
Data publikacji: 4 czerwca 2021
Data aktualizacji: 6 lipca 2024

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

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł 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.

Artykuły w czasopismach na temat "Dynamic programming"

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.
Więcej źródeł

Rozprawy doktorskie na temat "Dynamic programming"

1

Zhang, Yan. "Dynamic programming speedups /". View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CSED%202007%20ZHANGY.

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

Weimann, Oren. "Accelerating dynamic programming". Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53302.

Pełny tekst źródła
Streszczenie:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 129-136).
Dynamic Programming (DP) is a fundamental problem-solving technique that has been widely used for solving a broad range of search and optimization problems. While DP can be invoked when more specialized methods fail, this generality often incurs a cost in efficiency. We explore a unifying toolkit for speeding up DP, and algorithms that use DP as subroutines. Our methods and results can be summarized as follows. - Acceleration via Compression. Compression is traditionally used to efficiently store data. We use compression in order to identify repeats in the table that imply a redundant computation. Utilizing these repeats requires a new DP, and often different DPs for different compression schemes. We present the first provable speedup of the celebrated Viterbi algorithm (1967) that is used for the decoding and training of Hidden Markov Models (HMMs). Our speedup relies on the compression of the HMM's observable sequence. - Totally Monotone Matrices. It is well known that a wide variety of DPs can be reduced to the problem of finding row minima in totally monotone matrices. We introduce this scheme in the context of planar graph problems. In particular, we show that planar graph problems such as shortest paths, feasible flow, bipartite perfect matching, and replacement paths can be accelerated by DPs that exploit a total-monotonicity property of the shortest paths. - Combining Compression and Total Monotonicity. We introduce a method for accelerating string edit distance computation by combining compression and totally monotone matrices.
(cont.) In the heart of this method are algorithms for computing the edit distance between two straight-line programs. These enable us to exploits the compressibility of strings, even if each string is compressed using a different compression scheme. - Partial Tables. In typical DP settings, a table is filled in its entirety, where each cell corresponds to some subproblem. In some cases, by changing the DP, it is possible to compute asymptotically less cells of the table. We show that [theta](n³) subproblems are both necessary and sufficient for computing the similarity between two trees. This improves all known solutions and brings the idea of partial tables to its full extent. - Fractional Subproblems. In some DPs, the solution to a subproblem is a data structure rather than a single value. The entire data structure of a subproblem is then processed and used to construct the data structure of larger subproblems. We suggest a method for reusing parts of a subproblem's data structure. In some cases, such fractional parts remain unchanged when constructing the data structure of larger subproblems. In these cases, it is possible to copy this part of the data structure to the larger subproblem using only a constant number of pointer changes. We show how this idea can be used for finding the optimal tree searching strategy in linear time. This is a generalization of the well known binary search technique from arrays to trees.
by Oren Weimann.
Ph.D.
Style APA, Harvard, Vancouver, ISO itp.
3

Wong, K. H. "Dynamic programming in pattern recognition". Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.383059.

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

Moor, Oege de. "Categories, relations and dynamic programming". Thesis, University of Oxford, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305600.

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

Hinchliffe, Mark. "Dynamic modelling using genetic programming". Thesis, University of Newcastle Upon Tyne, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.391407.

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

Gallia, Jason. "Protein identification by dynamic programming". Diss., Online access via UMI:, 2009.

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

Batra, Jatin. "Dynamic programming for scheduling problems". Thesis, IIT Delhi, 2019. http://eprint.iitd.ac.in:80//handle/2074/8050.

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

Evers, Dirk J. "RNA folding via algebraic dynamic programming". [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968564844.

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

Archer, Grant R. "Seismic velocity analysis using dynamic programming /". Title page, contents and abstract only, 1987. http://web4.library.adelaide.edu.au/theses/09S.B/09s.ba671.pdf.

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

Sung, Joo-Ho. "Dynamic programming approaches to pension funding". Thesis, City University London, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.361860.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Książki na temat "Dynamic programming"

1

Kennedy, John O. S. Dynamic Programming. Dordrecht: Springer Netherlands, 1986. http://dx.doi.org/10.1007/978-94-009-4191-5.

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

Art, Lew, i Holger Mauch. Dynamic Programming. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-37014-7.

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

Sniedovich, Moshe. Dynamic programming. New York, N.Y: M. Dekker, 1992.

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

Powell, Warren B. Approximate Dynamic Programming. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2011. http://dx.doi.org/10.1002/9781118029176.

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

N, Tsitsiklis John, red. Neuro-dynamic programming. Belmont, Mass: Athena Scientific, 1996.

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

Sun, Jiayue, Shun Xu, Yang Liu i Huaguang Zhang. Adaptive Dynamic Programming. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-5929-7.

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

Jiang, Yu, i Zhong-Ping Jiang. Robust Adaptive Dynamic Programming. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2017. http://dx.doi.org/10.1002/9781119132677.

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

1947-, Dana Rose-Anne, red. Dynamic programming in economics. Boston: Kluwer Academic Publishers, 2003.

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

Ulmer, Marlin Wolf. Approximate Dynamic Programming for Dynamic Vehicle Routing. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-55511-9.

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

D, Robinett Rush, red. Applied dynamic programming for optimization of dynamical systems. Philadelphia: Society for Industrial and Applied Mathematics, 2005.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Części książek na temat "Dynamic programming"

1

Poler, Raúl, Josefa Mula i Manuel Díaz-Madroñero. "Dynamic Programming". W Operations Research Problems, 325–74. London: Springer London, 2013. http://dx.doi.org/10.1007/978-1-4471-5577-5_9.

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

Zabczyk, Jerzy. "Dynamic programming". W Systems & Control: Foundations & Applications, 137–51. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44778-6_9.

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

Čepin, Marko. "Dynamic Programming". W Assessment of Power System Reliability, 253–55. London: Springer London, 2011. http://dx.doi.org/10.1007/978-0-85729-688-7_17.

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

Blanchini, Franco, i Stefano Miani. "Dynamic programming". W Set-Theoretic Methods in Control, 149–89. Boston, MA: Birkhäuser Boston, 2008. http://dx.doi.org/10.1007/978-0-8176-4606-6_5.

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

Onori, Simona, Lorenzo Serrao i Giorgio Rizzoni. "Dynamic Programming". W SpringerBriefs in Electrical and Computer Engineering, 41–49. London: Springer London, 2015. http://dx.doi.org/10.1007/978-1-4471-6781-5_4.

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

Böhme, Thomas J., i Benjamin Frank. "Dynamic Programming". W Advances in Industrial Control, 199–214. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-51317-1_6.

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

Borne, Pierre, Dumitru Popescu, Florin Gh Filip, Dan Stefanoiu i Bernard Dubuisson. "Dynamic Programming". W Optimization in Engineering Sciences, 101–14. Hoboken, NJ USA: John Wiley & Sons, Inc., 2013. http://dx.doi.org/10.1002/9781118577899.ch3.

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

Faísca, Nuno P., Konstatinos I. Kouramas, Berç Rustem i Efstratios N. Pistikopoulos. "Dynamic Programming". W Process Systems Engineering, 151–72. Weinheim, Germany: Wiley-VCH Verlag GmbH & Co. KGaA, 2014. http://dx.doi.org/10.1002/9783527631209.ch7.

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

Faísca, Nuno P., Konstatinos I. Kouramas, Berç Rustem i Efstratios N. Pistikopoulos. "Dynamic Programming". W Multi-Parametric Programming, 151–72. Weinheim, Germany: Wiley-VCH Verlag GmbH & Co. KGaA, 2011. http://dx.doi.org/10.1002/9783527631216.ch7.

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

Stueben, Michael. "Dynamic Programming". W Good Habits for Great Coding, 253–305. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3459-4_21.

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

Streszczenia konferencji na temat "Dynamic programming"

1

Yamamoto, Eiko, Mikio Yamamoto, Kyoji Umemura i Kenneth W. Church. "Dynamic programming". W the fifth international workshop on. New York, New York, USA: ACM Press, 2000. http://dx.doi.org/10.1145/355214.355232.

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

Yamaguchi, Akihiko, i Christopher G. Atkeson. "Differential dynamic programming with temporally decomposed dynamics". W 2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids). IEEE, 2015. http://dx.doi.org/10.1109/humanoids.2015.7363430.

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

Kolter, J. Zico, Adam Coates, Andrew Y. Ng, Yi Gu i Charles DuHadway. "Space-indexed dynamic programming". W the 25th international conference. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1390156.1390218.

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

Rajamaki, Joose, Kourosh Naderi, Ville Kyrki i Perttu Hamalainen. "Sampled differential dynamic programming". W 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2016. http://dx.doi.org/10.1109/iros.2016.7759229.

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

Eppstein, D., Z. Galil i R. Giancarlo. "Speeding up dynamic programming". W [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. IEEE, 1988. http://dx.doi.org/10.1109/sfcs.1988.21965.

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

Plancher, Brian, Zachary Manchester i Scott Kuindersma. "Constrained unscented dynamic programming". W 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE, 2017. http://dx.doi.org/10.1109/iros.2017.8206457.

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

Chowdhury, Rezaul Alam, i Vijaya Ramachandran. "Cache-oblivious dynamic programming". W the seventeenth annual ACM-SIAM symposium. New York, New York, USA: ACM Press, 2006. http://dx.doi.org/10.1145/1109557.1109622.

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

Holmes, Ian, i Richard Durbin. "Dynamic programming alignment accuracy". W the second annual international conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/279069.279102.

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

Todorov, Emanuel, i Yuval Tassa. "Iterative local dynamic programming". W 2009 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL). IEEE, 2009. http://dx.doi.org/10.1109/adprl.2009.4927530.

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

Oshin, Alex, Matthew D. Houghton, Michael J. Acheson, Irene M. Gregory i Evangelos Theodorou. "Parameterized Differential Dynamic Programming". W Robotics: Science and Systems 2022. Robotics: Science and Systems Foundation, 2022. http://dx.doi.org/10.15607/rss.2022.xviii.046.

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

Raporty organizacyjne na temat "Dynamic programming"

1

Cai, Yongyang, Kenneth Judd, Thomas Lontzek, Valentina Michelangeli i Che-Lin Su. Nonlinear Programming Method for Dynamic Programming. Cambridge, MA: National Bureau of Economic Research, maj 2013. http://dx.doi.org/10.3386/w19034.

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

Cai, Yongyang, i Kenneth Judd. Dynamic Programming with Hermite Approximation. Cambridge, MA: National Bureau of Economic Research, listopad 2012. http://dx.doi.org/10.3386/w18540.

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

Gabaix, Xavier. Behavioral Macroeconomics Via Sparse Dynamic Programming. Cambridge, MA: National Bureau of Economic Research, styczeń 2016. http://dx.doi.org/10.3386/w21848.

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

Klotz, Edward S. Dynamic Pricing Criteria in Linear Programming. Fort Belvoir, VA: Defense Technical Information Center, lipiec 1988. http://dx.doi.org/10.21236/ada198945.

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

Bergen, Benjamin Karl. Legion Programming System: Dynamic Control Replication. Office of Scientific and Technical Information (OSTI), kwiecień 2020. http://dx.doi.org/10.2172/1615657.

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

Gabaix, Xavier. Boundedly Rational Dynamic Programming: Some Preliminary Results. Cambridge, MA: National Bureau of Economic Research, styczeń 2012. http://dx.doi.org/10.3386/w17783.

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

Rust, John. A Dynamic Programming Model of Retirement Behavior. Cambridge, MA: National Bureau of Economic Research, grudzień 1987. http://dx.doi.org/10.3386/w2470.

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

Kahou, Mahdi Ebrahimi, Jesús Fernández-Villaverde, Jesse Perla i Arnav Sood. Exploiting Symmetry in High-Dimensional Dynamic Programming. Cambridge, MA: National Bureau of Economic Research, lipiec 2021. http://dx.doi.org/10.3386/w28981.

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

Demmel, James. DEGAS: Dynamic Exascale Global Address Space Programming Environments. Office of Scientific and Technical Information (OSTI), luty 2018. http://dx.doi.org/10.2172/1423458.

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

Cai, Yongyang, Kenneth Judd, Greg Thain i Stephen Wright. Solving Dynamic Programming Problems on a Computational Grid. Cambridge, MA: National Bureau of Economic Research, styczeń 2013. http://dx.doi.org/10.3386/w18714.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Dynamic programming” dla poszczególnych typów źródeł:
Artykuły w czasopismach 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