Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(Dynamic programming algorithms)`

.
Showing records 1 – 30 of
61 total matches.

Search Limiters

Dates

- 2016 – 2020 (11)
- 2011 – 2015 (20)
- 2006 – 2010 (15)

▼ Search Limiters

Northeastern University

1. Karbeyaz, Ceyhun Efe. Optimized participant assignment for an online experimental framework.

Degree: PhD, Department of Electrical and Computer Engineering, 2015, Northeastern University

URL: http://hdl.handle.net/2047/D20193938

► Experimental research is being transformed from being based in physical laboratories centered in research universities into web-based experimental platforms. Our group has built a web-based…
(more)

Subjects/Keywords: job scheduling; optimization; participant assignment; Heuristic algorithms; Computer algorithms; Dynamic programming; Linear programming; Integer programming; Scheduling; Mathematical models

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Karbeyaz, C. E. (2015). Optimized participant assignment for an online experimental framework. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20193938

Chicago Manual of Style (16^{th} Edition):

Karbeyaz, Ceyhun Efe. “Optimized participant assignment for an online experimental framework.” 2015. Doctoral Dissertation, Northeastern University. Accessed February 17, 2020. http://hdl.handle.net/2047/D20193938.

MLA Handbook (7^{th} Edition):

Karbeyaz, Ceyhun Efe. “Optimized participant assignment for an online experimental framework.” 2015. Web. 17 Feb 2020.

Vancouver:

Karbeyaz CE. Optimized participant assignment for an online experimental framework. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/2047/D20193938.

Council of Science Editors:

Karbeyaz CE. Optimized participant assignment for an online experimental framework. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20193938

University of Florida

2. Fox, Andrew. An Assortment Optimization Decision-Support System Considering Product Capacity and Shelf Sizing.

Degree: 2009, University of Florida

URL: http://ufdc.ufl.edu/AA00060313

► The objective of this project is to create an operational decision-support system to aid retail management in selecting the optimal assortment of goods to provide…
(more)

Subjects/Keywords: Algorithms; Approximation; Customers; Dynamic programming; Integers; Marginal profit; Marginal utility

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Fox, A. (2009). An Assortment Optimization Decision-Support System Considering Product Capacity and Shelf Sizing. (Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/AA00060313

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Fox, Andrew. “An Assortment Optimization Decision-Support System Considering Product Capacity and Shelf Sizing.” 2009. Thesis, University of Florida. Accessed February 17, 2020. http://ufdc.ufl.edu/AA00060313.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fox, Andrew. “An Assortment Optimization Decision-Support System Considering Product Capacity and Shelf Sizing.” 2009. Web. 17 Feb 2020.

Vancouver:

Fox A. An Assortment Optimization Decision-Support System Considering Product Capacity and Shelf Sizing. [Internet] [Thesis]. University of Florida; 2009. [cited 2020 Feb 17]. Available from: http://ufdc.ufl.edu/AA00060313.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fox A. An Assortment Optimization Decision-Support System Considering Product Capacity and Shelf Sizing. [Thesis]. University of Florida; 2009. Available from: http://ufdc.ufl.edu/AA00060313

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

3. Malhotra, Raunaq. De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data.

Degree: PhD, Computer Science, 2016, Penn State University

URL: https://etda.libraries.psu.edu/catalog/s1784k724

► Next-generation sequencing (NGS) technologies have enabled fast profiling of diversity in population of closely related genomes over the past two decades in a high throughput…
(more)

Subjects/Keywords: De novo assembly algorithms; viral population reconstruction; dynamic programming algorithm

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Malhotra, R. (2016). De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/s1784k724

Chicago Manual of Style (16^{th} Edition):

Malhotra, Raunaq. “De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data.” 2016. Doctoral Dissertation, Penn State University. Accessed February 17, 2020. https://etda.libraries.psu.edu/catalog/s1784k724.

MLA Handbook (7^{th} Edition):

Malhotra, Raunaq. “De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data.” 2016. Web. 17 Feb 2020.

Vancouver:

Malhotra R. De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data. [Internet] [Doctoral dissertation]. Penn State University; 2016. [cited 2020 Feb 17]. Available from: https://etda.libraries.psu.edu/catalog/s1784k724.

Council of Science Editors:

Malhotra R. De novo methods for characterizing diversity in populations of genomes using next-generation sequencing data. [Doctoral Dissertation]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/s1784k724

North-West University

4. Van der Walt, Anetta. Mathematical modelling of blood spatter with optimization and other numerical methods / Anetta van der Walt .

Degree: 2014, North-West University

URL: http://hdl.handle.net/10394/12266

► The current methods used by forensic experts to analyse blood spatter neglects the influence of gravitation and drag on the trajectory of the droplet. This…
(more)

Subjects/Keywords: Bloodstain analysis; Fluid mechanics; Multi-target tracking; Linear programming; Dynamic programming; K-shortest path algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Van der Walt, A. (2014). Mathematical modelling of blood spatter with optimization and other numerical methods / Anetta van der Walt . (Thesis). North-West University. Retrieved from http://hdl.handle.net/10394/12266

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Van der Walt, Anetta. “Mathematical modelling of blood spatter with optimization and other numerical methods / Anetta van der Walt .” 2014. Thesis, North-West University. Accessed February 17, 2020. http://hdl.handle.net/10394/12266.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Van der Walt, Anetta. “Mathematical modelling of blood spatter with optimization and other numerical methods / Anetta van der Walt .” 2014. Web. 17 Feb 2020.

Vancouver:

Van der Walt A. Mathematical modelling of blood spatter with optimization and other numerical methods / Anetta van der Walt . [Internet] [Thesis]. North-West University; 2014. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/10394/12266.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Van der Walt A. Mathematical modelling of blood spatter with optimization and other numerical methods / Anetta van der Walt . [Thesis]. North-West University; 2014. Available from: http://hdl.handle.net/10394/12266

Not specified: Masters Thesis or Doctoral Dissertation

Universidade Federal de Mato Grosso do Sul

5. Lima, Leandro Ishi Soares de. O problema do alinhamento de segmentos .

Degree: 2013, Universidade Federal de Mato Grosso do Sul

URL: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/1893

► Dentre a variedade de problemas de otimização existentes, aqueles que envolvem sequências destacam-se por sua aplicabilidade em vários campos de pesquisa. Nesta dissertação apresentamos um…
(more)

Subjects/Keywords: Otimização Combinatória; Combinatorial Optimization; Algorítmos Genéticos; Genetic Algorithms; Programação Dinâmica; Dynamic Programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Lima, L. I. S. d. (2013). O problema do alinhamento de segmentos . (Thesis). Universidade Federal de Mato Grosso do Sul. Retrieved from http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/1893

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Lima, Leandro Ishi Soares de. “O problema do alinhamento de segmentos .” 2013. Thesis, Universidade Federal de Mato Grosso do Sul. Accessed February 17, 2020. http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/1893.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Lima, Leandro Ishi Soares de. “O problema do alinhamento de segmentos .” 2013. Web. 17 Feb 2020.

Vancouver:

Lima LISd. O problema do alinhamento de segmentos . [Internet] [Thesis]. Universidade Federal de Mato Grosso do Sul; 2013. [cited 2020 Feb 17]. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/1893.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lima LISd. O problema do alinhamento de segmentos . [Thesis]. Universidade Federal de Mato Grosso do Sul; 2013. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/1893

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

6.
Ann, Hsing-Yen.
Efficient *Algorithms* for the Block Edit Distance and Related Problems.

Degree: PhD, Computer Science and Engineering, 2010, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424

► Computing the similarity of two strings or sequences is one of the most important fundamental in computer field, and it has been widely studied for…
(more)

Subjects/Keywords: run-length encoding; longest common subsequence; dynamic programming; similarity; design of algorithms; block edit distance

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Ann, H. (2010). Efficient Algorithms for the Block Edit Distance and Related Problems. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424

Chicago Manual of Style (16^{th} Edition):

Ann, Hsing-Yen. “Efficient Algorithms for the Block Edit Distance and Related Problems.” 2010. Doctoral Dissertation, NSYSU. Accessed February 17, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424.

MLA Handbook (7^{th} Edition):

Ann, Hsing-Yen. “Efficient Algorithms for the Block Edit Distance and Related Problems.” 2010. Web. 17 Feb 2020.

Vancouver:

Ann H. Efficient Algorithms for the Block Edit Distance and Related Problems. [Internet] [Doctoral dissertation]. NSYSU; 2010. [cited 2020 Feb 17]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424.

Council of Science Editors:

Ann H. Efficient Algorithms for the Block Edit Distance and Related Problems. [Doctoral Dissertation]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0518110-225424

7. Baste, Julien. Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques.

Degree: Docteur es, Informatique, 2017, Montpellier

URL: http://www.theses.fr/2017MONTS065

►

Dans cette thèse, nous étudions la complexité paramétrée de problèmes combinatoires dans les graphes. Plus précisément, nous présentons une multitude d’algorithmes de programmation dynamique ainsi… (more)

Subjects/Keywords: Théorie des graphes; Treewidth; Algorithmes; Réductions; Programmation dynamique; Graph theory; Treewidth; Algorithms; Reductions; Dynamic programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Baste, J. (2017). Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques. (Doctoral Dissertation). Montpellier. Retrieved from http://www.theses.fr/2017MONTS065

Chicago Manual of Style (16^{th} Edition):

Baste, Julien. “Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques.” 2017. Doctoral Dissertation, Montpellier. Accessed February 17, 2020. http://www.theses.fr/2017MONTS065.

MLA Handbook (7^{th} Edition):

Baste, Julien. “Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques.” 2017. Web. 17 Feb 2020.

Vancouver:

Baste J. Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques. [Internet] [Doctoral dissertation]. Montpellier; 2017. [cited 2020 Feb 17]. Available from: http://www.theses.fr/2017MONTS065.

Council of Science Editors:

Baste J. Treewidth : algorithmic, combinatorial, and practical aspects : Treewidth : aspects algorithmiques, combinatoires et pratiques. [Doctoral Dissertation]. Montpellier; 2017. Available from: http://www.theses.fr/2017MONTS065

Michigan State University

8.
Bussema, Carl.
Effective *algorithms* for minimizing weighted and unweighted flow time in single and multiprocessor environments.

Degree: MS, Department of Computer Science, 2007, Michigan State University

URL: http://etd.lib.msu.edu/islandora/object/etd:38654

Subjects/Keywords: Computer scheduling; Computer algorithms; Dynamic programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bussema, C. (2007). Effective algorithms for minimizing weighted and unweighted flow time in single and multiprocessor environments. (Masters Thesis). Michigan State University. Retrieved from http://etd.lib.msu.edu/islandora/object/etd:38654

Chicago Manual of Style (16^{th} Edition):

Bussema, Carl. “Effective algorithms for minimizing weighted and unweighted flow time in single and multiprocessor environments.” 2007. Masters Thesis, Michigan State University. Accessed February 17, 2020. http://etd.lib.msu.edu/islandora/object/etd:38654.

MLA Handbook (7^{th} Edition):

Bussema, Carl. “Effective algorithms for minimizing weighted and unweighted flow time in single and multiprocessor environments.” 2007. Web. 17 Feb 2020.

Vancouver:

Bussema C. Effective algorithms for minimizing weighted and unweighted flow time in single and multiprocessor environments. [Internet] [Masters thesis]. Michigan State University; 2007. [cited 2020 Feb 17]. Available from: http://etd.lib.msu.edu/islandora/object/etd:38654.

Council of Science Editors:

Bussema C. Effective algorithms for minimizing weighted and unweighted flow time in single and multiprocessor environments. [Masters Thesis]. Michigan State University; 2007. Available from: http://etd.lib.msu.edu/islandora/object/etd:38654

University of Florida

9.
Buyuktahtakin, Ismet.
Mixed Integer *Programming* Approaches to Lot-Sizing and Asset Replacement Problems.

Degree: PhD, Industrial and Systems Engineering, 2009, University of Florida

URL: http://ufdc.ufl.edu/UFE0025002

► MIXED INTEGER *PROGRAMMING* APPROACHES TO LOT-SIZING AND ASSET REPLACEMENT PROBLEMS In this dissertation, we develop mixed integer *programming* approaches for solving capacitated lot-sizing and parallel…
(more)

Subjects/Keywords: Algorithms; Assets; Dynamic programming; Fixed charges; Fixed costs; Integer programming; Integers; Objective functions; Optimal solutions; Technological change; dynamic, integer, optimization, production, replacement

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Buyuktahtakin, I. (2009). Mixed Integer Programming Approaches to Lot-Sizing and Asset Replacement Problems. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0025002

Chicago Manual of Style (16^{th} Edition):

Buyuktahtakin, Ismet. “Mixed Integer Programming Approaches to Lot-Sizing and Asset Replacement Problems.” 2009. Doctoral Dissertation, University of Florida. Accessed February 17, 2020. http://ufdc.ufl.edu/UFE0025002.

MLA Handbook (7^{th} Edition):

Buyuktahtakin, Ismet. “Mixed Integer Programming Approaches to Lot-Sizing and Asset Replacement Problems.” 2009. Web. 17 Feb 2020.

Vancouver:

Buyuktahtakin I. Mixed Integer Programming Approaches to Lot-Sizing and Asset Replacement Problems. [Internet] [Doctoral dissertation]. University of Florida; 2009. [cited 2020 Feb 17]. Available from: http://ufdc.ufl.edu/UFE0025002.

Council of Science Editors:

Buyuktahtakin I. Mixed Integer Programming Approaches to Lot-Sizing and Asset Replacement Problems. [Doctoral Dissertation]. University of Florida; 2009. Available from: http://ufdc.ufl.edu/UFE0025002

Texas A&M University

10. Kanta, Lufthansa Rahman. A Risk-based Optimization Modeling Framework for Mitigating Fire Events for Water and Fire Response Infrastructures.

Degree: 2011, Texas A&M University

URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7367

► The purpose of this dissertation is to address risk and consequences of and effective mitigation strategies for urban fire events involving two critical infrastructures- water…
(more)

Subjects/Keywords: Risk Assessment; Dynamic Programming; Multi-objective Optimization; Evolutionary Computation based Algorithms; Hazard Mitigation; Urban Fire Risk; Water Distribution

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Kanta, L. R. (2011). A Risk-based Optimization Modeling Framework for Mitigating Fire Events for Water and Fire Response Infrastructures. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7367

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Kanta, Lufthansa Rahman. “A Risk-based Optimization Modeling Framework for Mitigating Fire Events for Water and Fire Response Infrastructures.” 2011. Thesis, Texas A&M University. Accessed February 17, 2020. http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7367.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Kanta, Lufthansa Rahman. “A Risk-based Optimization Modeling Framework for Mitigating Fire Events for Water and Fire Response Infrastructures.” 2011. Web. 17 Feb 2020.

Vancouver:

Kanta LR. A Risk-based Optimization Modeling Framework for Mitigating Fire Events for Water and Fire Response Infrastructures. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7367.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kanta LR. A Risk-based Optimization Modeling Framework for Mitigating Fire Events for Water and Fire Response Infrastructures. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-12-7367

Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

11.
Wei, Liang-Tai.
Ant Colony Optimization *Algorithms* for Sequence Assembly with Haplotyping.

Degree: Master, Computer Science and Engineering, 2005, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824105-164952

► The Human Genome Project completed in 2003 and the draft of human genome sequences were also yielded. It has been known that any two human…
(more)

Subjects/Keywords: Haplotype; Dynamic Programming; Sequence Assembly; Ant Colony Optimization Algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Wei, L. (2005). Ant Colony Optimization Algorithms for Sequence Assembly with Haplotyping. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824105-164952

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Wei, Liang-Tai. “Ant Colony Optimization Algorithms for Sequence Assembly with Haplotyping.” 2005. Thesis, NSYSU. Accessed February 17, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824105-164952.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Wei, Liang-Tai. “Ant Colony Optimization Algorithms for Sequence Assembly with Haplotyping.” 2005. Web. 17 Feb 2020.

Vancouver:

Wei L. Ant Colony Optimization Algorithms for Sequence Assembly with Haplotyping. [Internet] [Thesis]. NSYSU; 2005. [cited 2020 Feb 17]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824105-164952.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wei L. Ant Colony Optimization Algorithms for Sequence Assembly with Haplotyping. [Thesis]. NSYSU; 2005. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824105-164952

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

12.
Feng, Tianke.
Stochastic and *Dynamic* Sequential Decision Problems with Postponement Options.

Degree: PhD, Industrial and Systems Engineering, 2012, University of Florida

URL: http://ufdc.ufl.edu/UFE0044117

► Postponement naturally arises as an option for decisions under uncertainty, as it enables the acquisition of more information for better decisions. The value of postponement…
(more)

Subjects/Keywords: Aircraft; Algorithms; Carrying costs; Deadlines; Dynamic programming; Elevators; Financial investments; Freight; Heuristics; Optimal policy; optimization – postponement – sequential-decision

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Feng, T. (2012). Stochastic and Dynamic Sequential Decision Problems with Postponement Options. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044117

Chicago Manual of Style (16^{th} Edition):

Feng, Tianke. “Stochastic and Dynamic Sequential Decision Problems with Postponement Options.” 2012. Doctoral Dissertation, University of Florida. Accessed February 17, 2020. http://ufdc.ufl.edu/UFE0044117.

MLA Handbook (7^{th} Edition):

Feng, Tianke. “Stochastic and Dynamic Sequential Decision Problems with Postponement Options.” 2012. Web. 17 Feb 2020.

Vancouver:

Feng T. Stochastic and Dynamic Sequential Decision Problems with Postponement Options. [Internet] [Doctoral dissertation]. University of Florida; 2012. [cited 2020 Feb 17]. Available from: http://ufdc.ufl.edu/UFE0044117.

Council of Science Editors:

Feng T. Stochastic and Dynamic Sequential Decision Problems with Postponement Options. [Doctoral Dissertation]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044117

McGill University

13. Solar-Behelak, Claudie. Sur un problème de minimisation: localisation optimal d'une source.

Degree: MS, Department of Mathematics, 1974, McGill University

URL: http://digitool.library.mcgill.ca/thesisfile51943.pdf

Subjects/Keywords: Mathematical optimization.; Maxima and minima.; Algorithms.; Dynamic programming.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Solar-Behelak, C. (1974). Sur un problème de minimisation: localisation optimal d'une source. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile51943.pdf

Chicago Manual of Style (16^{th} Edition):

Solar-Behelak, Claudie. “Sur un problème de minimisation: localisation optimal d'une source.” 1974. Masters Thesis, McGill University. Accessed February 17, 2020. http://digitool.library.mcgill.ca/thesisfile51943.pdf.

MLA Handbook (7^{th} Edition):

Solar-Behelak, Claudie. “Sur un problème de minimisation: localisation optimal d'une source.” 1974. Web. 17 Feb 2020.

Vancouver:

Solar-Behelak C. Sur un problème de minimisation: localisation optimal d'une source. [Internet] [Masters thesis]. McGill University; 1974. [cited 2020 Feb 17]. Available from: http://digitool.library.mcgill.ca/thesisfile51943.pdf.

Council of Science Editors:

Solar-Behelak C. Sur un problème de minimisation: localisation optimal d'une source. [Masters Thesis]. McGill University; 1974. Available from: http://digitool.library.mcgill.ca/thesisfile51943.pdf

Victoria University of Wellington

14.
Brownrigg, Raymond Douglas.
*Dynamic**Programming* as a Scheduling Tool in Multiprogrammed Computing Systems.

Degree: 1978, Victoria University of Wellington

URL: http://hdl.handle.net/10063/549

► A potentially parallel iterative algorithm for the solution of the unconstrained N-stage decision problem of *Dynamic* *Programming* is developed. This new solution method, known as…
(more)

Subjects/Keywords: Production scheduling; Multiprogramming (electronic computers); Dynamic programming; Multiprogramming; Algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Brownrigg, R. D. (1978). Dynamic Programming as a Scheduling Tool in Multiprogrammed Computing Systems. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/549

Chicago Manual of Style (16^{th} Edition):

Brownrigg, Raymond Douglas. “Dynamic Programming as a Scheduling Tool in Multiprogrammed Computing Systems.” 1978. Doctoral Dissertation, Victoria University of Wellington. Accessed February 17, 2020. http://hdl.handle.net/10063/549.

MLA Handbook (7^{th} Edition):

Brownrigg, Raymond Douglas. “Dynamic Programming as a Scheduling Tool in Multiprogrammed Computing Systems.” 1978. Web. 17 Feb 2020.

Vancouver:

Brownrigg RD. Dynamic Programming as a Scheduling Tool in Multiprogrammed Computing Systems. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 1978. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/10063/549.

Council of Science Editors:

Brownrigg RD. Dynamic Programming as a Scheduling Tool in Multiprogrammed Computing Systems. [Doctoral Dissertation]. Victoria University of Wellington; 1978. Available from: http://hdl.handle.net/10063/549

15.
Alimehr, Leila.
The Performance of Sequence Alignment * Algorithms*.

Degree: Information Technology, 2013, Uppsala University

URL: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-200289

► This thesis deals with sequence alignment *algorithms*. The sequence alignment is a mutual arrange of two or more sequences in order to study their…
(more)

Subjects/Keywords: Algorithms; Dynamic programming; Genetics; Sequence alignment

…such as: sequence alignment, distance and *dynamic* *programming*. For more informations the… …indels, respectively.
2.4
*Dynamic* *Programming*
In bioinformatics, we use a sequence alignment… …such as *dynamic* *programming* method.
*Dynamic* *programming* is a technique that divides the… …when it is
encountered.
*Dynamic* *programming* is used usually for optimization problems. In the… …as an optimal solution to the problem.
*Dynamic* *programming* can be used for global alignment…

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Alimehr, L. (2013). The Performance of Sequence Alignment Algorithms. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-200289

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Alimehr, Leila. “The Performance of Sequence Alignment Algorithms.” 2013. Thesis, Uppsala University. Accessed February 17, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-200289.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Alimehr, Leila. “The Performance of Sequence Alignment Algorithms.” 2013. Web. 17 Feb 2020.

Vancouver:

Alimehr L. The Performance of Sequence Alignment Algorithms. [Internet] [Thesis]. Uppsala University; 2013. [cited 2020 Feb 17]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-200289.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alimehr L. The Performance of Sequence Alignment Algorithms. [Thesis]. Uppsala University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-200289

Not specified: Masters Thesis or Doctoral Dissertation

Hong Kong University of Science and Technology

16.
Zhang, Weihong.
* Algorithms* for partially observable Markov decision processes.

Degree: 2001, Hong Kong University of Science and Technology

URL: http://repository.ust.hk/ir/Record/1783.1-1525 ; https://doi.org/10.14711/thesis-b710758 ; http://repository.ust.hk/ir/bitstream/1783.1-1525/1/th_redirect.html

► Partially Observable Markov Decision Process (POMDP) is a general sequential decision-making model where the effects of actions are nondeterministic and only partial information about world…
(more)

Subjects/Keywords: Markov processes ; Statistical decision ; Dynamic programming ; Computer algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zhang, W. (2001). Algorithms for partially observable Markov decision processes. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-1525 ; https://doi.org/10.14711/thesis-b710758 ; http://repository.ust.hk/ir/bitstream/1783.1-1525/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zhang, Weihong. “Algorithms for partially observable Markov decision processes.” 2001. Thesis, Hong Kong University of Science and Technology. Accessed February 17, 2020. http://repository.ust.hk/ir/Record/1783.1-1525 ; https://doi.org/10.14711/thesis-b710758 ; http://repository.ust.hk/ir/bitstream/1783.1-1525/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zhang, Weihong. “Algorithms for partially observable Markov decision processes.” 2001. Web. 17 Feb 2020.

Vancouver:

Zhang W. Algorithms for partially observable Markov decision processes. [Internet] [Thesis]. Hong Kong University of Science and Technology; 2001. [cited 2020 Feb 17]. Available from: http://repository.ust.hk/ir/Record/1783.1-1525 ; https://doi.org/10.14711/thesis-b710758 ; http://repository.ust.hk/ir/bitstream/1783.1-1525/1/th_redirect.html.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhang W. Algorithms for partially observable Markov decision processes. [Thesis]. Hong Kong University of Science and Technology; 2001. Available from: http://repository.ust.hk/ir/Record/1783.1-1525 ; https://doi.org/10.14711/thesis-b710758 ; http://repository.ust.hk/ir/bitstream/1783.1-1525/1/th_redirect.html

Not specified: Masters Thesis or Doctoral Dissertation

Duke University

17.
Jou, Jonathan Dragon.
Novel Computational Protein Design *Algorithms* with Sparse Residue Interaction Graphs, Ensembles, and Mathematical Guarantees, and their Application to Antibody Design
.

Degree: 2018, Duke University

URL: http://hdl.handle.net/10161/16821

► Computational structure-based protein design seeks to harness the incredible biological power of proteins by designing proteins with new structures and even new function. In…
(more)

Subjects/Keywords: Computer science; Branch and Bound; Computational Protein Design; Dynamic Programming; Provable Algorithms; Sparse Residue Interaction Graphs; Thermodynamic Ensembles

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Jou, J. D. (2018). Novel Computational Protein Design Algorithms with Sparse Residue Interaction Graphs, Ensembles, and Mathematical Guarantees, and their Application to Antibody Design . (Thesis). Duke University. Retrieved from http://hdl.handle.net/10161/16821

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Jou, Jonathan Dragon. “Novel Computational Protein Design Algorithms with Sparse Residue Interaction Graphs, Ensembles, and Mathematical Guarantees, and their Application to Antibody Design .” 2018. Thesis, Duke University. Accessed February 17, 2020. http://hdl.handle.net/10161/16821.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Jou, Jonathan Dragon. “Novel Computational Protein Design Algorithms with Sparse Residue Interaction Graphs, Ensembles, and Mathematical Guarantees, and their Application to Antibody Design .” 2018. Web. 17 Feb 2020.

Vancouver:

Jou JD. Novel Computational Protein Design Algorithms with Sparse Residue Interaction Graphs, Ensembles, and Mathematical Guarantees, and their Application to Antibody Design . [Internet] [Thesis]. Duke University; 2018. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/10161/16821.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jou JD. Novel Computational Protein Design Algorithms with Sparse Residue Interaction Graphs, Ensembles, and Mathematical Guarantees, and their Application to Antibody Design . [Thesis]. Duke University; 2018. Available from: http://hdl.handle.net/10161/16821

Not specified: Masters Thesis or Doctoral Dissertation

University of Florida

18.
Zhao, Kun.
Mixed Integer *Programming* Approaches to 0-1 Knapsack Problems and Unified Stochastic and Robust Optimization on Wind Power Investment.

Degree: PhD, Industrial and Systems Engineering, 2015, University of Florida

URL: http://ufdc.ufl.edu/UFE0049286

► This dissertation covers a theoretical study of combining *dynamic* *programming* approach with cutting planes to solve the binary knapsack problems. In addition, motivated by the…
(more)

Subjects/Keywords: Algorithms; Financial investments; Investment decisions; Linear programming; Operations research; Optimal solutions; Robust optimization; Run time; Transmission lines; Wind power; 0-1kp – dynamic-programming – mixed-integer – optimization – robust – stochastic – wind-power

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Zhao, K. (2015). Mixed Integer Programming Approaches to 0-1 Knapsack Problems and Unified Stochastic and Robust Optimization on Wind Power Investment. (Doctoral Dissertation). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0049286

Chicago Manual of Style (16^{th} Edition):

Zhao, Kun. “Mixed Integer Programming Approaches to 0-1 Knapsack Problems and Unified Stochastic and Robust Optimization on Wind Power Investment.” 2015. Doctoral Dissertation, University of Florida. Accessed February 17, 2020. http://ufdc.ufl.edu/UFE0049286.

MLA Handbook (7^{th} Edition):

Zhao, Kun. “Mixed Integer Programming Approaches to 0-1 Knapsack Problems and Unified Stochastic and Robust Optimization on Wind Power Investment.” 2015. Web. 17 Feb 2020.

Vancouver:

Zhao K. Mixed Integer Programming Approaches to 0-1 Knapsack Problems and Unified Stochastic and Robust Optimization on Wind Power Investment. [Internet] [Doctoral dissertation]. University of Florida; 2015. [cited 2020 Feb 17]. Available from: http://ufdc.ufl.edu/UFE0049286.

Council of Science Editors:

Zhao K. Mixed Integer Programming Approaches to 0-1 Knapsack Problems and Unified Stochastic and Robust Optimization on Wind Power Investment. [Doctoral Dissertation]. University of Florida; 2015. Available from: http://ufdc.ufl.edu/UFE0049286

University of Western Australia

19. Di Pietro, Anthony. Optimising evolutionary strategies for problems with varying noise strength.

Degree: PhD, 2007, University of Western Australia

URL: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9395&local_base=GEN01-INS01

► For many real-world applications of evolutionary computation, the fitness function is obscured by random noise. This interferes with the evaluation and selection processes and adversely…
(more)

Subjects/Keywords: Noise; Genetic algorithms; Evolutionary programming (Computer science); Evolutionary computation; Noisy fitness function; Evolutionary strategy; Evolutionary computation; Noise landscape; Dynamic resampling; Adaptive dynamic resampling

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Di Pietro, A. (2007). Optimising evolutionary strategies for problems with varying noise strength. (Doctoral Dissertation). University of Western Australia. Retrieved from http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9395&local_base=GEN01-INS01

Chicago Manual of Style (16^{th} Edition):

Di Pietro, Anthony. “Optimising evolutionary strategies for problems with varying noise strength.” 2007. Doctoral Dissertation, University of Western Australia. Accessed February 17, 2020. http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9395&local_base=GEN01-INS01.

MLA Handbook (7^{th} Edition):

Di Pietro, Anthony. “Optimising evolutionary strategies for problems with varying noise strength.” 2007. Web. 17 Feb 2020.

Vancouver:

Di Pietro A. Optimising evolutionary strategies for problems with varying noise strength. [Internet] [Doctoral dissertation]. University of Western Australia; 2007. [cited 2020 Feb 17]. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9395&local_base=GEN01-INS01.

Council of Science Editors:

Di Pietro A. Optimising evolutionary strategies for problems with varying noise strength. [Doctoral Dissertation]. University of Western Australia; 2007. Available from: http://repository.uwa.edu.au:80/R/?func=dbin-jump-full&object_id=9395&local_base=GEN01-INS01

Delft University of Technology

20.
Delipetrev, B.
Nested *algorithms* for optimal reservoir operation and their embedding in a decision support platform.

Degree: 2016, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:isbn:9781138029828 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16

► Reservoir operation is a multi-objective optimization problem traditionally solved with *dynamic* *programming* (DP) and stochastic *dynamic* *programming* (SDP) *algorithms*. The thesis presents novel *algorithms* for…
(more)

Subjects/Keywords: novel optimization algorithms; nested dynamic programming; nested stochastic dynamic programming; nested reinforcement learning; cloud application

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Delipetrev, B. (2016). Nested algorithms for optimal reservoir operation and their embedding in a decision support platform. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:isbn:9781138029828 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16

Chicago Manual of Style (16^{th} Edition):

Delipetrev, B. “Nested algorithms for optimal reservoir operation and their embedding in a decision support platform.” 2016. Doctoral Dissertation, Delft University of Technology. Accessed February 17, 2020. http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:isbn:9781138029828 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16.

MLA Handbook (7^{th} Edition):

Delipetrev, B. “Nested algorithms for optimal reservoir operation and their embedding in a decision support platform.” 2016. Web. 17 Feb 2020.

Vancouver:

Delipetrev B. Nested algorithms for optimal reservoir operation and their embedding in a decision support platform. [Internet] [Doctoral dissertation]. Delft University of Technology; 2016. [cited 2020 Feb 17]. Available from: http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:isbn:9781138029828 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16.

Council of Science Editors:

Delipetrev B. Nested algorithms for optimal reservoir operation and their embedding in a decision support platform. [Doctoral Dissertation]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; urn:isbn:9781138029828 ; urn:NBN:nl:ui:24-uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16 ; http://resolver.tudelft.nl/uuid:2fdcbbc4-0905-4500-b0a5-3424880dfa16

Texas A&M University

21. Savage, Elizabeth. Cooperative control of autonomous underwater vehicles.

Degree: 2004, Texas A&M University

URL: http://hdl.handle.net/1969.1/236

► The proposed project is the simulation of a system to search for air vehicles which have splashed-down in the ocean. The system comprises a group…
(more)

Subjects/Keywords: autonomous; AUV; cooperative control; dynamic programming; genetic algorithms; optimal control; underwater search

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Savage, E. (2004). Cooperative control of autonomous underwater vehicles. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/236

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Savage, Elizabeth. “Cooperative control of autonomous underwater vehicles.” 2004. Thesis, Texas A&M University. Accessed February 17, 2020. http://hdl.handle.net/1969.1/236.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Savage, Elizabeth. “Cooperative control of autonomous underwater vehicles.” 2004. Web. 17 Feb 2020.

Vancouver:

Savage E. Cooperative control of autonomous underwater vehicles. [Internet] [Thesis]. Texas A&M University; 2004. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/1969.1/236.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Savage E. Cooperative control of autonomous underwater vehicles. [Thesis]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/236

Not specified: Masters Thesis or Doctoral Dissertation

The Ohio State University

22. Bokhari, Saniyah S. Parallel Solution of the Subset-sum Problem: An Empirical Study.

Degree: MS, Computer Science and Engineering, 2011, The Ohio State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=osu1305898281

► We investigate the parallelization of an algorithm on three very different architectures. These are: a 128-processor Cray XMT massively multithreaded machine, a 16-processor IBM…
(more)

Subjects/Keywords: Computer Engineering; Computer Science; Cray XMT; Dynamic Programming; IBM x3755; Multicore; Multithreading; NVIDIA FX 5800; OMP; Opteron; Parallel Algorithms; Parallel Computing; Shared Memory; Subset-sum problem

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Bokhari, S. S. (2011). Parallel Solution of the Subset-sum Problem: An Empirical Study. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1305898281

Chicago Manual of Style (16^{th} Edition):

Bokhari, Saniyah S. “Parallel Solution of the Subset-sum Problem: An Empirical Study.” 2011. Masters Thesis, The Ohio State University. Accessed February 17, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1305898281.

MLA Handbook (7^{th} Edition):

Bokhari, Saniyah S. “Parallel Solution of the Subset-sum Problem: An Empirical Study.” 2011. Web. 17 Feb 2020.

Vancouver:

Bokhari SS. Parallel Solution of the Subset-sum Problem: An Empirical Study. [Internet] [Masters thesis]. The Ohio State University; 2011. [cited 2020 Feb 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1305898281.

Council of Science Editors:

Bokhari SS. Parallel Solution of the Subset-sum Problem: An Empirical Study. [Masters Thesis]. The Ohio State University; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1305898281

University of Saskatchewan

23. Vassilev, Tzvetalin Simeonov. Optimal area triangulation.

Degree: 2005, University of Saskatchewan

URL: http://hdl.handle.net/10388/etd-08232005-111957

► Given a set of points in the Euclidean plane, we are interested in its triangulations, i.e., the maximal sets of non-overlapping triangles with vertices in…
(more)

Subjects/Keywords: computational geometry; geometric algorithms; dynamic programming; optimal triangulations; planar triangulations

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Vassilev, T. S. (2005). Optimal area triangulation. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/etd-08232005-111957

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Vassilev, Tzvetalin Simeonov. “Optimal area triangulation.” 2005. Thesis, University of Saskatchewan. Accessed February 17, 2020. http://hdl.handle.net/10388/etd-08232005-111957.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Vassilev, Tzvetalin Simeonov. “Optimal area triangulation.” 2005. Web. 17 Feb 2020.

Vancouver:

Vassilev TS. Optimal area triangulation. [Internet] [Thesis]. University of Saskatchewan; 2005. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/10388/etd-08232005-111957.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vassilev TS. Optimal area triangulation. [Thesis]. University of Saskatchewan; 2005. Available from: http://hdl.handle.net/10388/etd-08232005-111957

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

24. Hrazdira, Adam. Algoritmy řízení elektromobilu .

Degree: 2012, Brno University of Technology

URL: http://hdl.handle.net/11012/64030

► Cílem práce byl návrh a implementace řídicích algoritmů pro optimalizaci spotřeby energie elektrického vozidla. Hlavním úkolem byla optimalizace rozložení energie mezi hlavním zdrojem energie (bateriemi)…
(more)

Subjects/Keywords: Elektrické vozidlo; elektromobil; energetická optimalizace; řídicí algoritmy; statická optimalizace; baterie; super-kapacitory; dynamické programování.; Electric vehicle; energy optimization; control algorithms; static optimization; batteries; super-capacitors; dynamic programming.

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Hrazdira, A. (2012). Algoritmy řízení elektromobilu . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/64030

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Hrazdira, Adam. “Algoritmy řízení elektromobilu .” 2012. Thesis, Brno University of Technology. Accessed February 17, 2020. http://hdl.handle.net/11012/64030.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Hrazdira, Adam. “Algoritmy řízení elektromobilu .” 2012. Web. 17 Feb 2020.

Vancouver:

Hrazdira A. Algoritmy řízení elektromobilu . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/11012/64030.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hrazdira A. Algoritmy řízení elektromobilu . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/64030

Not specified: Masters Thesis or Doctoral Dissertation

Clemson University

25.
Jamieson, Alan.
Linear-Time *Algorithms* for Edge-Based Problems.

Degree: PhD, Computer Science, 2007, Clemson University

URL: https://tigerprints.clemson.edu/all_dissertations/101

► There is a dearth of *algorithms* that deal with edge-based problems in trees, specifically *algorithms* for edge sets that satisfy a particular parameter. The goal…
(more)

Subjects/Keywords: graph theory; dynamic programming; Wimer method; edge sets; algorithms; Computer Sciences

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Jamieson, A. (2007). Linear-Time Algorithms for Edge-Based Problems. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/101

Chicago Manual of Style (16^{th} Edition):

Jamieson, Alan. “Linear-Time Algorithms for Edge-Based Problems.” 2007. Doctoral Dissertation, Clemson University. Accessed February 17, 2020. https://tigerprints.clemson.edu/all_dissertations/101.

MLA Handbook (7^{th} Edition):

Jamieson, Alan. “Linear-Time Algorithms for Edge-Based Problems.” 2007. Web. 17 Feb 2020.

Vancouver:

Jamieson A. Linear-Time Algorithms for Edge-Based Problems. [Internet] [Doctoral dissertation]. Clemson University; 2007. [cited 2020 Feb 17]. Available from: https://tigerprints.clemson.edu/all_dissertations/101.

Council of Science Editors:

Jamieson A. Linear-Time Algorithms for Edge-Based Problems. [Doctoral Dissertation]. Clemson University; 2007. Available from: https://tigerprints.clemson.edu/all_dissertations/101

Université Paris-Sud – Paris XI

26. Rinaudo, Philippe. Algorithmique de l'alignement structure-séquence d'ARN : une approche générale et paramétrée : RNA structure-sequence alignment algorithmic : a general and parameterized approach.

Degree: Docteur es, Informatique, 2012, Université Paris-Sud – Paris XI

URL: http://www.theses.fr/2012PA112355

► L'alignement de macromolécules biologiques comme les protéines, l'ADN ou encore l'ARN est une problématique biologique et bio-informatique qui a pour but de révéler une partie…
(more)

Subjects/Keywords: Algorithmique; ARN; Alignement; Séquence arc-annotée; Décomposition arborescente; Algorithme paramétré; Programmation dynamique; Algorithmics; RNA; Alignment; Arc-annotated sequence; Tree decomposition; Parameterized algorithms; Dynamic programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Rinaudo, P. (2012). Algorithmique de l'alignement structure-séquence d'ARN : une approche générale et paramétrée : RNA structure-sequence alignment algorithmic : a general and parameterized approach. (Doctoral Dissertation). Université Paris-Sud – Paris XI. Retrieved from http://www.theses.fr/2012PA112355

Chicago Manual of Style (16^{th} Edition):

Rinaudo, Philippe. “Algorithmique de l'alignement structure-séquence d'ARN : une approche générale et paramétrée : RNA structure-sequence alignment algorithmic : a general and parameterized approach.” 2012. Doctoral Dissertation, Université Paris-Sud – Paris XI. Accessed February 17, 2020. http://www.theses.fr/2012PA112355.

MLA Handbook (7^{th} Edition):

Rinaudo, Philippe. “Algorithmique de l'alignement structure-séquence d'ARN : une approche générale et paramétrée : RNA structure-sequence alignment algorithmic : a general and parameterized approach.” 2012. Web. 17 Feb 2020.

Vancouver:

Rinaudo P. Algorithmique de l'alignement structure-séquence d'ARN : une approche générale et paramétrée : RNA structure-sequence alignment algorithmic : a general and parameterized approach. [Internet] [Doctoral dissertation]. Université Paris-Sud – Paris XI; 2012. [cited 2020 Feb 17]. Available from: http://www.theses.fr/2012PA112355.

Council of Science Editors:

Rinaudo P. Algorithmique de l'alignement structure-séquence d'ARN : une approche générale et paramétrée : RNA structure-sequence alignment algorithmic : a general and parameterized approach. [Doctoral Dissertation]. Université Paris-Sud – Paris XI; 2012. Available from: http://www.theses.fr/2012PA112355

RMIT University

27. Roozbeh, Iman. Optimisation approaches for an orienteering problem with applications to wildfire management.

Degree: 2019, RMIT University

URL: http://researchbank.rmit.edu.au/view/rmit:162938

► During uncontrollable wildfires, Incident Management Teams (ITMs) dispatch vehicles for tasks aimed at reducing the hazard to key assets. The deployment plan is complicated by…
(more)

Subjects/Keywords: Fields of Research; orienteering problem; asset protection problem; stochastic programming; adaptive large neighbourhood search; dynamic rerouting; synchronisation constraint; wildfire management; heuristic algorithms

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Roozbeh, I. (2019). Optimisation approaches for an orienteering problem with applications to wildfire management. (Thesis). RMIT University. Retrieved from http://researchbank.rmit.edu.au/view/rmit:162938

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Roozbeh, Iman. “Optimisation approaches for an orienteering problem with applications to wildfire management.” 2019. Thesis, RMIT University. Accessed February 17, 2020. http://researchbank.rmit.edu.au/view/rmit:162938.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Roozbeh, Iman. “Optimisation approaches for an orienteering problem with applications to wildfire management.” 2019. Web. 17 Feb 2020.

Vancouver:

Roozbeh I. Optimisation approaches for an orienteering problem with applications to wildfire management. [Internet] [Thesis]. RMIT University; 2019. [cited 2020 Feb 17]. Available from: http://researchbank.rmit.edu.au/view/rmit:162938.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Roozbeh I. Optimisation approaches for an orienteering problem with applications to wildfire management. [Thesis]. RMIT University; 2019. Available from: http://researchbank.rmit.edu.au/view/rmit:162938

Not specified: Masters Thesis or Doctoral Dissertation

Virginia Tech

28. Belal, Nahla Ahmed. Two Problems in Computational Genomics.

Degree: PhD, Computer Science, 2011, Virginia Tech

URL: http://hdl.handle.net/10919/26318

► This work addresses two novel problems in the field of computational genomics. The first is whole genome alignment and the second is inferring horizontal gene…
(more)

Subjects/Keywords: horizontal gene transfer; Two Problems in Computational Genomics; whole genome alignment; dynamic programming; Graph theory; biology and genetics; graph algorithms; partial order sets

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Belal, N. A. (2011). Two Problems in Computational Genomics. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26318

Chicago Manual of Style (16^{th} Edition):

Belal, Nahla Ahmed. “Two Problems in Computational Genomics.” 2011. Doctoral Dissertation, Virginia Tech. Accessed February 17, 2020. http://hdl.handle.net/10919/26318.

MLA Handbook (7^{th} Edition):

Belal, Nahla Ahmed. “Two Problems in Computational Genomics.” 2011. Web. 17 Feb 2020.

Vancouver:

Belal NA. Two Problems in Computational Genomics. [Internet] [Doctoral dissertation]. Virginia Tech; 2011. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/10919/26318.

Council of Science Editors:

Belal NA. Two Problems in Computational Genomics. [Doctoral Dissertation]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/26318

MIT

29.
Myers, Cory S.
A comparative study of several *dynamic* time warping
*algorithms* for speech recognition
.

Degree: MS, Electrical Engineering and Computer Science, 1980, MIT

URL: http://hdl.handle.net/1721.1/27909

Subjects/Keywords: Electrical Engineering and Computer Science.; Algorithms; Speech perception; Dynamic programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Myers, C. S. (1980). A comparative study of several dynamic time warping algorithms for speech recognition . (Masters Thesis). MIT. Retrieved from http://hdl.handle.net/1721.1/27909

Chicago Manual of Style (16^{th} Edition):

Myers, Cory S. “A comparative study of several dynamic time warping algorithms for speech recognition .” 1980. Masters Thesis, MIT. Accessed February 17, 2020. http://hdl.handle.net/1721.1/27909.

MLA Handbook (7^{th} Edition):

Myers, Cory S. “A comparative study of several dynamic time warping algorithms for speech recognition .” 1980. Web. 17 Feb 2020.

Vancouver:

Myers CS. A comparative study of several dynamic time warping algorithms for speech recognition . [Internet] [Masters thesis]. MIT; 1980. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/1721.1/27909.

Council of Science Editors:

Myers CS. A comparative study of several dynamic time warping algorithms for speech recognition . [Masters Thesis]. MIT; 1980. Available from: http://hdl.handle.net/1721.1/27909

University of Waterloo

30. Nicholson, Patrick. The application of the in-tree knapsack problem to routing prefix caches.

Degree: 2009, University of Waterloo

URL: http://hdl.handle.net/10012/4364

► Modern routers use specialized hardware, such as Ternary Content Addressable Memory (TCAM), to solve the Longest Prefix Matching Problem (LPMP) quickly. Due to the fact…
(more)

Subjects/Keywords: tree knapsack problem; routing prefix caching; approximation algorithms; dynamic programming

Record Details Similar Records

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^{th} Edition):

Nicholson, P. (2009). The application of the in-tree knapsack problem to routing prefix caches. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4364

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Nicholson, Patrick. “The application of the in-tree knapsack problem to routing prefix caches.” 2009. Thesis, University of Waterloo. Accessed February 17, 2020. http://hdl.handle.net/10012/4364.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Nicholson, Patrick. “The application of the in-tree knapsack problem to routing prefix caches.” 2009. Web. 17 Feb 2020.

Vancouver:

Nicholson P. The application of the in-tree knapsack problem to routing prefix caches. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2020 Feb 17]. Available from: http://hdl.handle.net/10012/4364.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nicholson P. The application of the in-tree knapsack problem to routing prefix caches. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4364

Not specified: Masters Thesis or Doctoral Dissertation