Log in

Relevant bibliographies by topics / Dynamic programming / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Dynamic programming.

Dissertations / Theses on the topic 'Dynamic programming'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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

Select a source type:

Consult the top 50 dissertations / theses for your research 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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 129-136).<br>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 ca

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

11

Khalaf, Rania Y. (Rania Yousef) 1978. "Multi-person tracking using dynamic programming." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/16768.

Full text

Abstract:

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.<br>Includes bibliographical references (p. 75-77).<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>by Rania Y. Khalaf.<br>M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

12

Sadiq, Mohammad. "Approximate Dynamic Programming Methods in HEVs." Thesis, KTH, Maskinkonstruktion (Inst.), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-182762.

Full text

Abstract:

Hybrid Electric Vehicles (HEV) have been gaining popularity worldwide for their efficient fuel consumption and therefore an overall reduction in the oil demand. This greatly benefits the environment since this leads to lesser emissions and hence lower greenhouse effect. Therefore research in this field is very active with a demand for new and better fuel consumption strategies. Many different methods for the energy management of HEV are being used, one particular method which promises global optimality is Dynamic Programming. Dynamic Programming yields a global optimum results but suffers from

APA, Harvard, Vancouver, ISO, and other styles

13

Ramalingam, Mohan Kumar. "Moving Horizon Estimation with Dynamic Programming." Cleveland State University / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=csu1386778712.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Gaddoni, Giacomo. "Modeling of Evolutionary Cancer Dynamics and Optimal Treatment via Dynamic Programming." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021.

Find full text

Abstract:

Cancer is one of the biggest challenges in healthcare. Fast diagnosis and personalized pharmacological therapies are essential for lowering the mortality rate. In this thesis, we propose a general-purpose model for cancer and an optimal control strategy to minimize its volume. Firstly, we analyze the literature about cancer in the System and Control community and produce a taxonomy of cancer typologies. We identify four main behaviors arising in these models: growth, mutation, migration, and drug response. After this preliminary analysis, we propose a cancer treatment model based on Ordinary D

APA, Harvard, Vancouver, ISO, and other styles

15

Diep, Vivian Chan. "Me.TV : a visual programming language and interface for dynamic media programming." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/101844.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2015.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 59-60).<br>The culture of televised media experiences has changed very little since the time it began in the 1930s, but new internet technologies, like Netflix, Hulu, and Youtube, are now quickly forcing major change. Although these new internet technologies have given the viewer more control than the historical dial, they have also left behind some of the greatest contributions

APA, Harvard, Vancouver, ISO, and other styles

16

Kaminsky, Andrew D. "Dynamic channel allocation." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2003. http://library.nps.navy.mil/uhtbin/hyperion-image/03sep%5FKaminsky.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Mekarapiruk, Wichaya. "Simultaneous optimal parameter selection and dynamic optimization using iterative dynamic programming." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ58926.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Calvo, Diego R., and Michail Musatov. "Pricing American Style Asian OptionsUsing Dynamic Programming." Thesis, Mälardalens högskola, Akademin för utbildning, kultur och kommunikation, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-9880.

Full text

Abstract:

The objective of this study is to implement a Java applet for calculating Bermudan/American-Asian call option prices and to obtain their respective optimal exercise strategies. Additionally, the study presents a computational time analysis and the effect of the variables on the option price.

APA, Harvard, Vancouver, ISO, and other styles

19

Lamond, Bernard Fernand. "Matrix methods in queueing and dynamic programming." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/27124.

Full text

Abstract:

We investigate some modern matrix methods for the solution of finite state stochastic models with an infinite time horizon. Markov and semi-Markov decision processes and finite queues in tandem with exponential service times are considered. The methods are based on the Drazin generalized inverse and use matrix decomposition. Unlike the related Jordan canonical form, the decompositions considered are numerically tractable and use real arithmetic when the original matrix has real entries. The spectral structure of the transition matrix of a Markov chain, deduced from non-negative matrix theory,

APA, Harvard, Vancouver, ISO, and other styles

20

Axelsson, Nils. "Dynamic Programming Algorithms for Semantic Dependency Parsing." Thesis, Linköpings universitet, Interaktiva och kognitiva system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138594.

Full text

Abstract:

Dependency parsing can be a useful tool to allow computers to parse text. In 2015, Kuhlmann and Jonsson proposed a logical deduction system that parsed to non-crossing dependency graphs with an asymptotic time complexity of O(n3), where “n” is the length of the sentence to parse. This thesis extends the deduction system by Kuhlmann and Jonsson; the extended deduction system introduces certain crossing edges, while maintaining an asymptotic time complexity of O(n4). In order to extend the deduction system by Kuhlmann and Jonsson, fifteen logical item types are added to the five proposed by Kuhl

APA, Harvard, Vancouver, ISO, and other styles

21

Babu, George Jithin. "Look-Ahead Platooning through Guided Dynamic Programming." Thesis, KTH, Reglerteknik, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-121540.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Dai, Peng. "FASTER DYNAMIC PROGRAMMING FOR MARKOV DECISION PROCESSES." UKnowledge, 2007. http://uknowledge.uky.edu/gradschool_theses/428.

Full text

Abstract:

Markov decision processes (MDPs) are a general framework used by Artificial Intelligence (AI) researchers to model decision theoretic planning problems. Solving real world MDPs has been a major and challenging research topic in the AI literature. This paper discusses two main groups of approaches in solving MDPs. The first group of approaches combines the strategies of heuristic search and dynamic programming to expedite the convergence process. The second makes use of graphical structures in MDPs to decrease the effort of classic dynamic programming algorithms. Two new algorithms proposed by

APA, Harvard, Vancouver, ISO, and other styles

23

SKYRME, ALEXANDRE RUPERT ARPINI. "SAFE RECORD SHARING IN DYNAMIC PROGRAMMING LANGUAGES." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2015. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=25871@1.

Full text

Abstract:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>Linguagens de programação dinâmicas estão cada vez mais populares e já foram utilizadas para desenvolver uma ampla gama de aplicações. Enquanto isso, processadores multi-núcleo se tornaram padrão, mesmo em computadores pessoais e dispositivos móveis. Dessa forma, os programadores precisam recorrer ao paralelismo para aprimorar o desempenho de seus programas. Entretanto, a programação concorrente permanece difícil. Adicionalmente, a despeito d

APA, Harvard, Vancouver, ISO, and other styles

24

Eslinger, Gregory John. "Dynamic programming applied to electromagnetic satellite actuation." Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/82480.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2013.<br>This electronic version was submitted and approved by the author's academic department as part of an electronic thesis pilot project. The certified thesis is available in the Institute Archives and Special Collections.<br>"June 2013." Cataloged from department-submitted PDF version of thesis<br>Includes bibliographical references (p. 135-140).<br>Electromagnetic formation flight (EMFF) is an enabling technology for a number of space mission architectures. While much work has been done for EMF

APA, Harvard, Vancouver, ISO, and other styles

25

Vyzas, Elias. "Approximate dynamic programming for some queueing problems." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/10282.

Full text

Abstract:

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 1997, and Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1997.<br>Includes bibliographical references (p. 81-82).<br>by Elias Vyzas.<br>M.S.

APA, Harvard, Vancouver, ISO, and other styles

26

Zhao, Mengyao. "Genomic variation detection using dynamic programming methods." Thesis, Boston College, 2014. http://hdl.handle.net/2345/bc-ir:104357.

Full text

Abstract:

Thesis advisor: Gabor T. Marth<br>Background: Due to the rapid development and application of next generation sequencing (NGS) techniques, large amounts of NGS data have become available for genome-related biological research, such as population genetics, evolutionary research, and genome wide association studies. A crucial step of these genome-related studies is the detection of genomic variation between different species and individuals. Current approaches for the detection of genomic variation can be classified into alignment-based variation detection and assembly-based variation detection.

APA, Harvard, Vancouver, ISO, and other styles

27

Höner, zu Siederdissen Christian, Sonja J. Prohaska, and Peter F. Stadler. "Algebraic dynamic programming over general data structures." Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-206280.

Full text

Abstract:

Background: Dynamic programming algorithms provide exact solutions to many problems in computational biology, such as sequence alignment, RNA folding, hidden Markov models (HMMs), and scoring of phylogenetic trees. Structurally analogous algorithms compute optimal solutions, evaluate score distributions, and perform stochastic sampling. This is explained in the theory of Algebraic Dynamic Programming (ADP) by a strict separation of state space traversal (usually represented by a context free grammar), scoring (encoded as an algebra), and choice rule. A key ingredient in this theory is the use

APA, Harvard, Vancouver, ISO, and other styles

28

Wang, Xia. "Applications of genetic algorithms, dynamic programming, and linear programming to combinatorial optimization problems." College Park, Md.: University of Maryland, 2008. http://hdl.handle.net/1903/8778.

Full text

Abstract:

Thesis (Ph. D.) -- University of Maryland, College Park, 2008.<br>Thesis research directed by: Applied Mathematics & Statistics, and Scientific Computation Program. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.

APA, Harvard, Vancouver, ISO, and other styles

29

Burrows, Richard B. P. "Dynamic load balancing." Thesis, University of Oxford, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.363886.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Steffen, Peter. "Compiling a domain specific language for dynamic programming." [S.l.] : [s.n.], 2006. http://deposit.ddb.de/cgi-bin/dokserv?idn=983062382.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Ardi, Shanai. "A Nonlinear Programming Approach for Dynamic Voltage Scaling." Thesis, Linköping University, Department of Computer and Information Science, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2774.

Full text

Abstract:

<p>Embedded computing systems in portable devices need to be energy efficient, yet they have to deliver adequate performance to the often computationally expensive applications. Dynamic voltage scaling is a technique that offers a speed versus power trade-off, allowing the application to achieve considerable energy savings and, at the same time, to meet the imposed time constraints.</p><p>In this thesis, we explore the possibility of using optimal voltage scaling algorithms based on nonlinear programming at the system level, for a complex multiprocessor scheduling problem. We present an optimi

APA, Harvard, Vancouver, ISO, and other styles

32

Christofides, Elina. "Dynamic programming for asset, liability and risk management." Thesis, Imperial College London, 2004. http://hdl.handle.net/10044/1/8371.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Zhu, Hong. "Dynamic programming algorithm for segmentation of CVC syllables." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape15/PQDD_0001/MQ29004.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Lévesque, Moren. "Models of entrepreneurial decisions, a dynamic programming approach." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ34577.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Sauré, Antoine. "Approximate dynamic programming methods for advance patient scheduling." Thesis, University of British Columbia, 2012. http://hdl.handle.net/2429/43448.

Full text

Abstract:

This dissertation studies an advance multi-priority patient scheduling problem. Patrick et al. (2008) formulated a version of this problem as a discounted infinite-horizon Markov decision process (MDP) and studied it using a linear programming method based on an affine value function approximation. This thesis starts by presenting an alternative solution approach for this problem based on the use of simulation, a policy iteration framework and a non-linear value function approximation. It then extends the dynamic multi-priority patient scheduling model and solution approach developed by Patric

APA, Harvard, Vancouver, ISO, and other styles

36

Yoshimoto, Yui, Yoshiyuki Karuno, and Shinji Imahori. "Dynamic Programming Algorithms for Duplex Food Packing Problems." IEEE, 2010. http://hdl.handle.net/2237/14459.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Child, Christopher H. T. "Approximate dynamic programming with parallel stochastic planning operators." Thesis, City University London, 2011. http://openaccess.city.ac.uk/1109/.

Full text

Abstract:

This thesis presents an approximate dynamic programming (ADP) technique for environment modelling agents. The agent learns a set of parallel stochastic planning operators (P-SPOs) by evaluating changes in its environment in response to actions, using an association rule mining approach. An approximate policy is then derived by iteratively improving state value aggregation estimates attached to the operators using the P-SPOs as a model in a Dyna-Q-like architecture. Reinforcement learning and dynamic programming are powerful techniques for automated agent decision making in stochastic environme

APA, Harvard, Vancouver, ISO, and other styles

38

Liu, Ning. "Approximate dynamic programming algorithms for production-planning problems." Thesis, Wichita State University, 2013. http://hdl.handle.net/10057/10636.

Full text

Abstract:

The capacitated lot-sizing problem (CLSP) is a core problem for successfully reducing overall costs in any production process. The exact approaches proposed for solving the CLSP are based on two major methods: mixed-integer programming and dynamic programming. This thesis provides a new idea for approximating the inventory cost function to be used in a truncated dynamic program for solving the CLSP. In the proposed method, by using only a partial dynamic process, the inventory cost function is approximated, and then the resulting approximate cost function is used as a value function in each st

APA, Harvard, Vancouver, ISO, and other styles

39

Van, Roy Benjamin. "Feature-based methods for large scale dynamic programming." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/11865.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Demir, Ramazan. "An approximate dynamic programming approach to discrete optimization." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/9137.

Full text

Abstract:

Thesis (Ph.D.)--Massachusetts Institute of Technology, Sloan School of Management, Operations Research Center, 2000.<br>Includes bibliographical references (leaves 181-189).<br>We develop Approximate Dynamic Programming (ADP) methods to integer programming problems. We describe and investigate parametric, nonparametric and base-heuristic learning approaches to approximate the value function in order to break the curse of dimensionality. Through an extensive computational study we illustrate that our ADP approach to integer programming competes successfully with existing methodologies including

APA, Harvard, Vancouver, ISO, and other styles

41

Al-Dujaily, Ra'ed. "Embedded dynamic programming networks for networks-on-chip." Thesis, University of Newcastle upon Tyne, 2013. http://hdl.handle.net/10443/1884.

Full text

Abstract:

Relentless technology downscaling and recent technological advancements in three dimensional integrated circuit (3D-IC) provide a promising prospect to realize heterogeneous system-on-chip (SoC) and homogeneous chip multiprocessor (CMP) based on the networks-onchip (NoCs) paradigm with augmented scalability, modularity and performance. In many cases in such systems, scheduling and managing communication resources are the major design and implementation challenges instead of the computing resources. Past research efforts were mainly focused on complex design-time or simple heuristic run-time ap

APA, Harvard, Vancouver, ISO, and other styles

42

Cai, C. "Adaptive traffic signal control using approximate dynamic programming." Thesis, University College London (University of London), 2010. http://discovery.ucl.ac.uk/20164/.

Full text

Abstract:

This thesis presents a study on an adaptive traffic signal controller for real-time operation. An approximate dynamic programming (ADP) algorithm is developed for controlling traffic signals at isolated intersection and in distributed traffic networks. This approach is derived from the premise that classic dynamic programming is computationally difficult to solve, and approximation is the second-best option for establishing sequential decision-making for complex process. The proposed ADP algorithm substantially reduces computational burden by using a linear approximation function to replace th

APA, Harvard, Vancouver, ISO, and other styles

43

HÃ¤ring, Thomas W. "Optimizing loblolly pine management with stochastic dynamic programming." Diss., Virginia Tech, 1993. http://hdl.handle.net/10919/39478.

Full text

Abstract:

This study examines effects of unpredictable price fluctuations and possible catastrophic losses on the optimal site preparation intensity of un thinned loblolly pine plantations under the assumption of lisk aversion. It concentrates exclusively on financial motives and does not take non-market values and portfolio considerations into account. The results should be interpreted with these limitations in mind. Two approaches are taken to compare site preparation intensities: a quasideterministic approach, where expected cash flows are discounted with risk-adjusted discount rates, and a stochast

APA, Harvard, Vancouver, ISO, and other styles

44

Häring, Thomas W. "Optimizing loblolly pine management with stochastic dynamic programming /." This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-10022007-144537/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Elshqeirat, Basima Ahmad Haroun. "Optimizing reliable network topology design using dynamic programming." Thesis, Curtin University, 2015. http://hdl.handle.net/20.500.11937/823.

Full text

Abstract:

This thesis addresses four reliable network topology design problems that consider reliability, cost, and/or bandwidth performance metrics. The optimization problems include one or two objectives and one constraint, each of which is known NP-hard. All problems consider all-terminal and/or two-terminal reliability measures. Four heuristic dynamic programming approaches are proposed, and 10 order criteria are used to improve their optimality and time efficiency. Simulations on hundreds of networks show the merits of the proposed methods.

APA, Harvard, Vancouver, ISO, and other styles

46

Zetka, Petr. "Programový systém pro řešení úloh dynamického programování." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2011. http://www.nusl.cz/ntk/nusl-229701.

Full text

Abstract:

This work deals with building a program system for solving dynamic programming problems on a computer. The theoretical part describes dynamic programming as a tool used for optimizing multistage decision processes and dynamic programming problems implemented in the program system. The practical part describes the design and implementation of the program system and verification of its functionality.

APA, Harvard, Vancouver, ISO, and other styles

47

Piveropoulos, Giannis. "Dynamic object-oriented systems." Thesis, University of York, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.298492.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Chang, Chia-Yuan, and 張嘉元. "Fuzzy Multiobjective Dynamic Programming." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/61755792753239392383.

Full text

Abstract:

碩士<br>國立臺灣大學<br>化學工程學系<br>86<br>The dynamic optimization for chemical processes usually has the following properties : (1) highly nonlinear (2) containing complex and discontinuous constraints and (3) delay arguments. The conventional maximum principle approaches often encounter som problems such as unstable integration and difficulties in obtaining global optimum. In this study, the use of iterative dynamic programming(IDP) presents the advantages of obtaining global optimum, solving problem without tran

APA, Harvard, Vancouver, ISO, and other styles

49

Węgrzycki, Karol. "Provably optimal dynamic programming." Doctoral thesis, 2021. https://depotuw.ceon.pl/handle/item/3869.

Full text

Abstract:

In this thesis we study an application of dynamic programming technique to graph problems and approximation algorithms. We improve upon state-of-the-art algorithms for All-Nodes Shortest Cycles, distance oracles, approximate algorithm for Partition, weak approximation for Subset Sum and others. We also present equivalence classes for certain problems, that admit algorithms based on dynamic programming. Namely: • (min, +)-convolution and knapsack problem, • (min, max)-convolution and strongly polynomial approximate (min, max) - convolution, • (min, max)-product and strongly polynomial approxima

APA, Harvard, Vancouver, ISO, and other styles

50

Ozaki, Hiroyuki. "Biconvergent stochastic dynamic programming." 1992. http://catalog.hathitrust.org/api/volumes/oclc/28405066.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!