Relevant bibliographies by topics / Dynamic programming

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Dynamic programming'

Author: Grafiati
Published: 4 June 2021
Last updated: 2 November 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Dynamic programming.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Dynamic programming"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Dynamic programming"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Dynamic programming"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Blanchini, Franco, and Stefano Miani. "Dynamic programming." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Dynamic programming"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Dynamic programming"

1

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Dynamic programming' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography