Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( Exact Exponential Algorithm). Showing records 1 – 30 of 8432 total matches.

[1] [2] [3] [4] [5] … [282]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Kyoto University / 京都大学

1. Norhazwani, Md Yunos. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム.

Degree: 博士(情報学), 2017, Kyoto University / 京都大学

新制・課程博士

甲第20516号

情博第644号

Subjects/Keywords: Traveling Salesman Problem; Exact Exponential Algorithm; Branch-and-reduce; Measure-and-conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Norhazwani, M. Y. (2017). Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム.” 2017. Thesis, Kyoto University / 京都大学. Accessed January 22, 2021. http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム.” 2017. Web. 22 Jan 2021.

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. [Internet] [Thesis]. Kyoto University / 京都大学; 2017. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. [Thesis]. Kyoto University / 京都大学; 2017. Available from: http://hdl.handle.net/2433/225741 ; http://dx.doi.org/10.14989/doctor.k20516

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Kyoto University

2. Norhazwani, Md Yunos. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .

Degree: 2017, Kyoto University

Subjects/Keywords: Traveling Salesman Problem; Exact Exponential Algorithm; Branch-and-reduce; Measure-and-conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Norhazwani, M. Y. (2017). Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . (Thesis). Kyoto University. Retrieved from http://hdl.handle.net/2433/225741

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .” 2017. Thesis, Kyoto University. Accessed January 22, 2021. http://hdl.handle.net/2433/225741.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Norhazwani, Md Yunos. “Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs .” 2017. Web. 22 Jan 2021.

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . [Internet] [Thesis]. Kyoto University; 2017. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2433/225741.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . [Thesis]. Kyoto University; 2017. Available from: http://hdl.handle.net/2433/225741

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Vieira Milreu, Paulo. Enumerating functional substructures of genome-scale metabolic networks : stories, precursors and organisations : Énumération de sous-structures fonctionnelle dans des réseaux métaboliques complets : Histoires métaboliques, précurseurs et organisations chimiques.

Degree: Docteur es, Bioinformatique, 2012, Université Claude Bernard – Lyon I

Dans cette thèse, nous avons présenté trois méthodes différentes pour l’énumération de sousréseauxparticuliers d’un réseau métabolique: les histoires métaboliques, les ensembles minimaux deprécurseurs et les… (more)

Subjects/Keywords: Algorithme; Complexité; Graphes; Exact exponentiel; Randomisation; Biologie computationelle; Graphe acyclique dirigé maximal; Histoire métabolique; Réseau métabolique; Algorithm; Complexity; Graphs; Exact exponential; Randomisation; Computational biology; Maximal directed acyclic graph; Metabolic story; Metabolic network; 570.15

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vieira Milreu, P. (2012). Enumerating functional substructures of genome-scale metabolic networks : stories, precursors and organisations : Énumération de sous-structures fonctionnelle dans des réseaux métaboliques complets : Histoires métaboliques, précurseurs et organisations chimiques. (Doctoral Dissertation). Université Claude Bernard – Lyon I. Retrieved from http://www.theses.fr/2012LYO10267

Chicago Manual of Style (16th Edition):

Vieira Milreu, Paulo. “Enumerating functional substructures of genome-scale metabolic networks : stories, precursors and organisations : Énumération de sous-structures fonctionnelle dans des réseaux métaboliques complets : Histoires métaboliques, précurseurs et organisations chimiques.” 2012. Doctoral Dissertation, Université Claude Bernard – Lyon I. Accessed January 22, 2021. http://www.theses.fr/2012LYO10267.

MLA Handbook (7th Edition):

Vieira Milreu, Paulo. “Enumerating functional substructures of genome-scale metabolic networks : stories, precursors and organisations : Énumération de sous-structures fonctionnelle dans des réseaux métaboliques complets : Histoires métaboliques, précurseurs et organisations chimiques.” 2012. Web. 22 Jan 2021.

Vancouver:

Vieira Milreu P. Enumerating functional substructures of genome-scale metabolic networks : stories, precursors and organisations : Énumération de sous-structures fonctionnelle dans des réseaux métaboliques complets : Histoires métaboliques, précurseurs et organisations chimiques. [Internet] [Doctoral dissertation]. Université Claude Bernard – Lyon I; 2012. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2012LYO10267.

Council of Science Editors:

Vieira Milreu P. Enumerating functional substructures of genome-scale metabolic networks : stories, precursors and organisations : Énumération de sous-structures fonctionnelle dans des réseaux métaboliques complets : Histoires métaboliques, précurseurs et organisations chimiques. [Doctoral Dissertation]. Université Claude Bernard – Lyon I; 2012. Available from: http://www.theses.fr/2012LYO10267


University of New South Wales

4. Wang, Xubo. Efficiently Computing Exact Set Similarity Joins.

Degree: Computer Science & Engineering, 2018, University of New South Wales

 Set similarity join, which finds all the similar set pairs from two collections of sets, is a fundamental problem with a wide range of applications… (more)

Subjects/Keywords: Parallel Algorithm; Exact Set Similarity Join; Incremental Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, X. (2018). Efficiently Computing Exact Set Similarity Joins. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Wang, Xubo. “Efficiently Computing Exact Set Similarity Joins.” 2018. Doctoral Dissertation, University of New South Wales. Accessed January 22, 2021. http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true.

MLA Handbook (7th Edition):

Wang, Xubo. “Efficiently Computing Exact Set Similarity Joins.” 2018. Web. 22 Jan 2021.

Vancouver:

Wang X. Efficiently Computing Exact Set Similarity Joins. [Internet] [Doctoral dissertation]. University of New South Wales; 2018. [cited 2021 Jan 22]. Available from: http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true.

Council of Science Editors:

Wang X. Efficiently Computing Exact Set Similarity Joins. [Doctoral Dissertation]. University of New South Wales; 2018. Available from: http://handle.unsw.edu.au/1959.4/60433 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:52219/SOURCE02?view=true


George Mason University

5. Nies, Brandi. A Comparative Test of Traveling Salesman Solutions from GIS Software Packages .

Degree: 2015, George Mason University

 The Traveling Salesman Problem (TSP) has long been studied and remains a challenge in the realm of combinatorial optimization across many disciplines. This research investigates… (more)

Subjects/Keywords: network analysis; traveling salesman; route optimization; GIS; heuristic; exact algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nies, B. (2015). A Comparative Test of Traveling Salesman Solutions from GIS Software Packages . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/9720

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nies, Brandi. “A Comparative Test of Traveling Salesman Solutions from GIS Software Packages .” 2015. Thesis, George Mason University. Accessed January 22, 2021. http://hdl.handle.net/1920/9720.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nies, Brandi. “A Comparative Test of Traveling Salesman Solutions from GIS Software Packages .” 2015. Web. 22 Jan 2021.

Vancouver:

Nies B. A Comparative Test of Traveling Salesman Solutions from GIS Software Packages . [Internet] [Thesis]. George Mason University; 2015. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/1920/9720.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nies B. A Comparative Test of Traveling Salesman Solutions from GIS Software Packages . [Thesis]. George Mason University; 2015. Available from: http://hdl.handle.net/1920/9720

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Minnesota

6. Wu, Zeyang. Fast exact algorithms for optimization problems in resource allocation and switched linear systems.

Degree: PhD, Industrial Engineering, 2019, University of Minnesota

 Discrete optimization is a branch of mathematical optimization where some of the decision variables are restricted to real values in a discrete set. The use… (more)

Subjects/Keywords: Exact algorithm; Mixed-integer program; Resource allocation; Switched linear systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, Z. (2019). Fast exact algorithms for optimization problems in resource allocation and switched linear systems. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/206239

Chicago Manual of Style (16th Edition):

Wu, Zeyang. “Fast exact algorithms for optimization problems in resource allocation and switched linear systems.” 2019. Doctoral Dissertation, University of Minnesota. Accessed January 22, 2021. http://hdl.handle.net/11299/206239.

MLA Handbook (7th Edition):

Wu, Zeyang. “Fast exact algorithms for optimization problems in resource allocation and switched linear systems.” 2019. Web. 22 Jan 2021.

Vancouver:

Wu Z. Fast exact algorithms for optimization problems in resource allocation and switched linear systems. [Internet] [Doctoral dissertation]. University of Minnesota; 2019. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/11299/206239.

Council of Science Editors:

Wu Z. Fast exact algorithms for optimization problems in resource allocation and switched linear systems. [Doctoral Dissertation]. University of Minnesota; 2019. Available from: http://hdl.handle.net/11299/206239

7. Tejaswi, Nunna. Performance Analysis on Hybrid and ExactMethods for Solving Clustered VRP : A Comparative Study on VRP Algorithms.

Degree: 2017, , Department of Computer Science and Engineering

  Context: The Vehicle Routing Problem is an NP-hard problem with a combination of varieties oftopics like logistics, optimization research and data mining. There is… (more)

Subjects/Keywords: Vehicle routing problem; logistics; clustering; genetic algorithm; exact algorithm; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tejaswi, N. (2017). Performance Analysis on Hybrid and ExactMethods for Solving Clustered VRP : A Comparative Study on VRP Algorithms. (Thesis). , Department of Computer Science and Engineering. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tejaswi, Nunna. “Performance Analysis on Hybrid and ExactMethods for Solving Clustered VRP : A Comparative Study on VRP Algorithms.” 2017. Thesis, , Department of Computer Science and Engineering. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tejaswi, Nunna. “Performance Analysis on Hybrid and ExactMethods for Solving Clustered VRP : A Comparative Study on VRP Algorithms.” 2017. Web. 22 Jan 2021.

Vancouver:

Tejaswi N. Performance Analysis on Hybrid and ExactMethods for Solving Clustered VRP : A Comparative Study on VRP Algorithms. [Internet] [Thesis]. , Department of Computer Science and Engineering; 2017. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14112.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tejaswi N. Performance Analysis on Hybrid and ExactMethods for Solving Clustered VRP : A Comparative Study on VRP Algorithms. [Thesis]. , Department of Computer Science and Engineering; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-14112

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

8. van der Sar, Erica (author). Multi-attribute vehicle routing problems: Exploring the limits of exact methods in practice.

Degree: 2018, Delft University of Technology

The companies CQM and EVO-it work together to help many different companies with solving their vehicle routing problems. EVO-it provides the interface of the software… (more)

Subjects/Keywords: Vehicle Routing; Exact algorithm; Exact Method; Set Partitioning; Two-index flow; Three-index flow; heterogeneous vehicles

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

van der Sar, E. (. (2018). Multi-attribute vehicle routing problems: Exploring the limits of exact methods in practice. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:ec15c141-289b-4a8d-ae76-652bae893ab4

Chicago Manual of Style (16th Edition):

van der Sar, Erica (author). “Multi-attribute vehicle routing problems: Exploring the limits of exact methods in practice.” 2018. Masters Thesis, Delft University of Technology. Accessed January 22, 2021. http://resolver.tudelft.nl/uuid:ec15c141-289b-4a8d-ae76-652bae893ab4.

MLA Handbook (7th Edition):

van der Sar, Erica (author). “Multi-attribute vehicle routing problems: Exploring the limits of exact methods in practice.” 2018. Web. 22 Jan 2021.

Vancouver:

van der Sar E(. Multi-attribute vehicle routing problems: Exploring the limits of exact methods in practice. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2021 Jan 22]. Available from: http://resolver.tudelft.nl/uuid:ec15c141-289b-4a8d-ae76-652bae893ab4.

Council of Science Editors:

van der Sar E(. Multi-attribute vehicle routing problems: Exploring the limits of exact methods in practice. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:ec15c141-289b-4a8d-ae76-652bae893ab4


Université de Lorraine

9. Sayadi, Mohamed Yosri. Construction et analyse des algorithmes exacts et exponentiels : énumération input-sensitive : Design and analysis of exact exponential algorithms : input-sensitive enumeration.

Degree: Docteur es, Informatique, 2019, Université de Lorraine

Moon et Moser ont prouvé que le nombre maximum des ensembles stables maximaux dans un graphe de n sommets est au plus 3n/3. Cette borne,… (more)

Subjects/Keywords: Algorithmique; Exact; Exponentiel; Graphes; Énumération; Input-sensitive; Problèmes NP-difficiles; Algorithms; Exact; Exponential; Graphs; NP-hard problems; Time complexity; Enumeration; Input-sensitive; 005.1; 004.015 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sayadi, M. Y. (2019). Construction et analyse des algorithmes exacts et exponentiels : énumération input-sensitive : Design and analysis of exact exponential algorithms : input-sensitive enumeration. (Doctoral Dissertation). Université de Lorraine. Retrieved from http://www.theses.fr/2019LORR0316

Chicago Manual of Style (16th Edition):

Sayadi, Mohamed Yosri. “Construction et analyse des algorithmes exacts et exponentiels : énumération input-sensitive : Design and analysis of exact exponential algorithms : input-sensitive enumeration.” 2019. Doctoral Dissertation, Université de Lorraine. Accessed January 22, 2021. http://www.theses.fr/2019LORR0316.

MLA Handbook (7th Edition):

Sayadi, Mohamed Yosri. “Construction et analyse des algorithmes exacts et exponentiels : énumération input-sensitive : Design and analysis of exact exponential algorithms : input-sensitive enumeration.” 2019. Web. 22 Jan 2021.

Vancouver:

Sayadi MY. Construction et analyse des algorithmes exacts et exponentiels : énumération input-sensitive : Design and analysis of exact exponential algorithms : input-sensitive enumeration. [Internet] [Doctoral dissertation]. Université de Lorraine; 2019. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2019LORR0316.

Council of Science Editors:

Sayadi MY. Construction et analyse des algorithmes exacts et exponentiels : énumération input-sensitive : Design and analysis of exact exponential algorithms : input-sensitive enumeration. [Doctoral Dissertation]. Université de Lorraine; 2019. Available from: http://www.theses.fr/2019LORR0316


NSYSU

10. Liao, Hao-Chung. Construction of approximate optimal designs by exchange algorithm.

Degree: Master, Applied Mathematics, 2002, NSYSU

 In this study we will consider the construction of approximate optimal design for one-dimensional regression by exchange algorithm. Sufficient conditions under which an optimal design… (more)

Subjects/Keywords: D-optima; approximate; exact; exchange algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, H. (2002). Construction of approximate optimal designs by exchange algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0606102-142718

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Liao, Hao-Chung. “Construction of approximate optimal designs by exchange algorithm.” 2002. Thesis, NSYSU. Accessed January 22, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0606102-142718.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Liao, Hao-Chung. “Construction of approximate optimal designs by exchange algorithm.” 2002. Web. 22 Jan 2021.

Vancouver:

Liao H. Construction of approximate optimal designs by exchange algorithm. [Internet] [Thesis]. NSYSU; 2002. [cited 2021 Jan 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0606102-142718.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liao H. Construction of approximate optimal designs by exchange algorithm. [Thesis]. NSYSU; 2002. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0606102-142718

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Norte

11. Pereira, Elder Gonçalves. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .

Degree: 2014, Universidade do Rio Grande do Norte

 The Hiker Dice was a game recently proposed in a software designed by Mara Kuzmich and Leonardo Goldbarg. In the game a dice is responsible… (more)

Subjects/Keywords: Hiker Dice. Algoritmo Exato. Algoritmos Heurísticos; Hiker Dice. Exact Algorithm. Heuristic Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pereira, E. G. (2014). O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . (Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Thesis, Universidade do Rio Grande do Norte. Accessed January 22, 2021. http://repositorio.ufrn.br/handle/123456789/18104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Web. 22 Jan 2021.

Vancouver:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Internet] [Thesis]. Universidade do Rio Grande do Norte; 2014. [cited 2021 Jan 22]. Available from: http://repositorio.ufrn.br/handle/123456789/18104.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Thesis]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/18104

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Universidade do Rio Grande do Norte

12. Pereira, Elder Gonçalves. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .

Degree: 2014, Universidade do Rio Grande do Norte

 The Hiker Dice was a game recently proposed in a software designed by Mara Kuzmich and Leonardo Goldbarg. In the game a dice is responsible… (more)

Subjects/Keywords: Hiker Dice. Algoritmo Exato. Algoritmos Heurísticos; Hiker Dice. Exact Algorithm. Heuristic Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pereira, E. G. (2014). O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . (Masters Thesis). Universidade do Rio Grande do Norte. Retrieved from http://repositorio.ufrn.br/handle/123456789/18104

Chicago Manual of Style (16th Edition):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Masters Thesis, Universidade do Rio Grande do Norte. Accessed January 22, 2021. http://repositorio.ufrn.br/handle/123456789/18104.

MLA Handbook (7th Edition):

Pereira, Elder Gonçalves. “O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico .” 2014. Web. 22 Jan 2021.

Vancouver:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Internet] [Masters thesis]. Universidade do Rio Grande do Norte; 2014. [cited 2021 Jan 22]. Available from: http://repositorio.ufrn.br/handle/123456789/18104.

Council of Science Editors:

Pereira EG. O problema do Hiker Dice em tabuleiro compacto: um estudo algorítmico . [Masters Thesis]. Universidade do Rio Grande do Norte; 2014. Available from: http://repositorio.ufrn.br/handle/123456789/18104


Wayne State University

13. Turgut, Ozgu. Exact And Representative Algorithms For Multi Objective Optimization.

Degree: PhD, Industrial and Manufacturing Engineering, 2013, Wayne State University

  In most real-life problems, the decision alternatives are evaluated with multiple conflicting criteria. The entire set of non-dominated solutions for practical problems is impossible… (more)

Subjects/Keywords: algorithm; branch-and-bound; exact; multi-objective; optimization; representative; Engineering; Operational Research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Turgut, O. (2013). Exact And Representative Algorithms For Multi Objective Optimization. (Doctoral Dissertation). Wayne State University. Retrieved from https://digitalcommons.wayne.edu/oa_dissertations/929

Chicago Manual of Style (16th Edition):

Turgut, Ozgu. “Exact And Representative Algorithms For Multi Objective Optimization.” 2013. Doctoral Dissertation, Wayne State University. Accessed January 22, 2021. https://digitalcommons.wayne.edu/oa_dissertations/929.

MLA Handbook (7th Edition):

Turgut, Ozgu. “Exact And Representative Algorithms For Multi Objective Optimization.” 2013. Web. 22 Jan 2021.

Vancouver:

Turgut O. Exact And Representative Algorithms For Multi Objective Optimization. [Internet] [Doctoral dissertation]. Wayne State University; 2013. [cited 2021 Jan 22]. Available from: https://digitalcommons.wayne.edu/oa_dissertations/929.

Council of Science Editors:

Turgut O. Exact And Representative Algorithms For Multi Objective Optimization. [Doctoral Dissertation]. Wayne State University; 2013. Available from: https://digitalcommons.wayne.edu/oa_dissertations/929

14. MOTA, Alexandre Cabral. Model checking CSPZ: Techniques to overcome state explosion .

Degree: 2001, Universidade Federal de Pernambuco

Cabral Mota, Alexandre; Cezar Alves Sampaio, Augusto. Model checking CSPZ: Techniques to overcome state explosion. 2001. Tese (Doutorado). Programa de Pós-Graduação em Ciência da Computação, Universidade Federal de Pernambuco, Recife, 2001. Advisors/Committee Members: Sampaio, Augusto Cezar Alves (advisor).

Subjects/Keywords: CSPz; Algorithm implementations; Exponential explosion; Theorem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

MOTA, A. C. (2001). Model checking CSPZ: Techniques to overcome state explosion . (Thesis). Universidade Federal de Pernambuco. Retrieved from http://repositorio.ufpe.br/handle/123456789/1909

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

MOTA, Alexandre Cabral. “Model checking CSPZ: Techniques to overcome state explosion .” 2001. Thesis, Universidade Federal de Pernambuco. Accessed January 22, 2021. http://repositorio.ufpe.br/handle/123456789/1909.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

MOTA, Alexandre Cabral. “Model checking CSPZ: Techniques to overcome state explosion .” 2001. Web. 22 Jan 2021.

Vancouver:

MOTA AC. Model checking CSPZ: Techniques to overcome state explosion . [Internet] [Thesis]. Universidade Federal de Pernambuco; 2001. [cited 2021 Jan 22]. Available from: http://repositorio.ufpe.br/handle/123456789/1909.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

MOTA AC. Model checking CSPZ: Techniques to overcome state explosion . [Thesis]. Universidade Federal de Pernambuco; 2001. Available from: http://repositorio.ufpe.br/handle/123456789/1909

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Plymouth

15. Arabi, Mohamed. Improving fairness and utilisation in ad hoc networks.

Degree: PhD, 2012, University of Plymouth

 Ad hoc networks represent the current de-facto alternative for infrastructure-less environments, due to their self-configuring and resilience characteristics. Ad hoc networks flexibility benefits, such as… (more)

Subjects/Keywords: 004.68; Fairness, channel utilisation, ad hoc networks, 802.11, contention window, exponential back off algorithm.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arabi, M. (2012). Improving fairness and utilisation in ad hoc networks. (Doctoral Dissertation). University of Plymouth. Retrieved from http://hdl.handle.net/10026.1/1167

Chicago Manual of Style (16th Edition):

Arabi, Mohamed. “Improving fairness and utilisation in ad hoc networks.” 2012. Doctoral Dissertation, University of Plymouth. Accessed January 22, 2021. http://hdl.handle.net/10026.1/1167.

MLA Handbook (7th Edition):

Arabi, Mohamed. “Improving fairness and utilisation in ad hoc networks.” 2012. Web. 22 Jan 2021.

Vancouver:

Arabi M. Improving fairness and utilisation in ad hoc networks. [Internet] [Doctoral dissertation]. University of Plymouth; 2012. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10026.1/1167.

Council of Science Editors:

Arabi M. Improving fairness and utilisation in ad hoc networks. [Doctoral Dissertation]. University of Plymouth; 2012. Available from: http://hdl.handle.net/10026.1/1167


University of New South Wales

16. Ye, Shanglin. Signal Detection and Parameter Estimation for Nuclear Magnetic Resonance Spectroscopy.

Degree: Electrical Engineering & Telecommunications, 2015, University of New South Wales

 Nuclear Magnetic Resonance spectroscopy (NMR), as the prime technique for efficient and rapid screening of the compounds in chemical samples, represents the nuclei in molecules… (more)

Subjects/Keywords: Complex exponential; Nuclear magnetic resonance; Frequency estimation; Interpolation algorithm; High resolution spectral estimator; Lineshape adaptation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ye, S. (2015). Signal Detection and Parameter Estimation for Nuclear Magnetic Resonance Spectroscopy. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/55307 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:37090/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Ye, Shanglin. “Signal Detection and Parameter Estimation for Nuclear Magnetic Resonance Spectroscopy.” 2015. Doctoral Dissertation, University of New South Wales. Accessed January 22, 2021. http://handle.unsw.edu.au/1959.4/55307 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:37090/SOURCE02?view=true.

MLA Handbook (7th Edition):

Ye, Shanglin. “Signal Detection and Parameter Estimation for Nuclear Magnetic Resonance Spectroscopy.” 2015. Web. 22 Jan 2021.

Vancouver:

Ye S. Signal Detection and Parameter Estimation for Nuclear Magnetic Resonance Spectroscopy. [Internet] [Doctoral dissertation]. University of New South Wales; 2015. [cited 2021 Jan 22]. Available from: http://handle.unsw.edu.au/1959.4/55307 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:37090/SOURCE02?view=true.

Council of Science Editors:

Ye S. Signal Detection and Parameter Estimation for Nuclear Magnetic Resonance Spectroscopy. [Doctoral Dissertation]. University of New South Wales; 2015. Available from: http://handle.unsw.edu.au/1959.4/55307 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:37090/SOURCE02?view=true

17. Sultan, Ziad. Algèbre linéaire exacte, parallèle, adaptative et générique : Adaptive and generic parallel exact linear algebra.

Degree: Docteur es, Mathématiques Appliquées, 2016, Université Grenoble Alpes (ComUE)

Les décompositions en matrices triangulaires sont une brique de base fondamentale en calcul algébrique. Ils sont utilisés pour résoudre des systèmes linéaires et calculer le… (more)

Subjects/Keywords: Calcul parallèl; Algèbre linéaire; Calcul exact; Algorithme adaptatives; Mathématiques computationnelles; Parallèlisme de flot de données; Parallel computation; Computer algebra; Exact computation; Adaptive algorithm; Computational mathematics; Dataflow parallelism; 510

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sultan, Z. (2016). Algèbre linéaire exacte, parallèle, adaptative et générique : Adaptive and generic parallel exact linear algebra. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2016GREAM030

Chicago Manual of Style (16th Edition):

Sultan, Ziad. “Algèbre linéaire exacte, parallèle, adaptative et générique : Adaptive and generic parallel exact linear algebra.” 2016. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed January 22, 2021. http://www.theses.fr/2016GREAM030.

MLA Handbook (7th Edition):

Sultan, Ziad. “Algèbre linéaire exacte, parallèle, adaptative et générique : Adaptive and generic parallel exact linear algebra.” 2016. Web. 22 Jan 2021.

Vancouver:

Sultan Z. Algèbre linéaire exacte, parallèle, adaptative et générique : Adaptive and generic parallel exact linear algebra. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2016. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2016GREAM030.

Council of Science Editors:

Sultan Z. Algèbre linéaire exacte, parallèle, adaptative et générique : Adaptive and generic parallel exact linear algebra. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2016. Available from: http://www.theses.fr/2016GREAM030

18. Letourneur, Romain. Algorithmes exacts et exponentiels pour des problèmes de graphes : Exact exponential algorithms for solving graph problems summary.

Degree: Docteur es, Informatique, 2015, Université d'Orléans

De nombreux problèmes algorithmiques sont « difficiles », dans le sens où on ne sait pas les résoudre en temps polynomial par rapport à la… (more)

Subjects/Keywords: Algorithmes; Algorithmes exacts exponentiels; Graphes; Ensembles dominants; Domination romaine faible; Ensemble connexe tropical; Algorithms; Exact exponential algorithms; Graphs; Dominating sets; Weak roman domination; Tropical connected set; 005.1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Letourneur, R. (2015). Algorithmes exacts et exponentiels pour des problèmes de graphes : Exact exponential algorithms for solving graph problems summary. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2015ORLE2022

Chicago Manual of Style (16th Edition):

Letourneur, Romain. “Algorithmes exacts et exponentiels pour des problèmes de graphes : Exact exponential algorithms for solving graph problems summary.” 2015. Doctoral Dissertation, Université d'Orléans. Accessed January 22, 2021. http://www.theses.fr/2015ORLE2022.

MLA Handbook (7th Edition):

Letourneur, Romain. “Algorithmes exacts et exponentiels pour des problèmes de graphes : Exact exponential algorithms for solving graph problems summary.” 2015. Web. 22 Jan 2021.

Vancouver:

Letourneur R. Algorithmes exacts et exponentiels pour des problèmes de graphes : Exact exponential algorithms for solving graph problems summary. [Internet] [Doctoral dissertation]. Université d'Orléans; 2015. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2015ORLE2022.

Council of Science Editors:

Letourneur R. Algorithmes exacts et exponentiels pour des problèmes de graphes : Exact exponential algorithms for solving graph problems summary. [Doctoral Dissertation]. Université d'Orléans; 2015. Available from: http://www.theses.fr/2015ORLE2022


The Ohio State University

19. Sridhar, Vijay, Sridhar. On the effect of asymmetry and dimension on computational geometric problems.

Degree: PhD, Computer Science and Engineering, 2018, The Ohio State University

 We study two aspects of metric spaces that affect the computational complexity of geometric problems. First, we study directed cut problems and the associated multi-commodity… (more)

Subjects/Keywords: Computer Science; Metric-Embeddings; Quasimetrics; Random-Embeddings; Treewidth; Directed Sparsest-Cut; Directed Multi-Cut; Fractal-Dimension; Exact-Algorithms; Fixed-Parameter-Tractability; Approximation- Schemes; Spanners; Lower-Bounds; Exponential-Time-Hypothesis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sridhar, Vijay, S. (2018). On the effect of asymmetry and dimension on computational geometric problems. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304

Chicago Manual of Style (16th Edition):

Sridhar, Vijay, Sridhar. “On the effect of asymmetry and dimension on computational geometric problems.” 2018. Doctoral Dissertation, The Ohio State University. Accessed January 22, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304.

MLA Handbook (7th Edition):

Sridhar, Vijay, Sridhar. “On the effect of asymmetry and dimension on computational geometric problems.” 2018. Web. 22 Jan 2021.

Vancouver:

Sridhar, Vijay S. On the effect of asymmetry and dimension on computational geometric problems. [Internet] [Doctoral dissertation]. The Ohio State University; 2018. [cited 2021 Jan 22]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304.

Council of Science Editors:

Sridhar, Vijay S. On the effect of asymmetry and dimension on computational geometric problems. [Doctoral Dissertation]. The Ohio State University; 2018. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1531362300593304


Univerzitet u Beogradu

20. Kordić, Stevan Lj., 1969-. Метод седиментације и његове примјене у проблемима дискретне математике.

Degree: Matematički fakultet, 2018, Univerzitet u Beogradu

Математика - Дискретна математика / Mathematics - Discrete mathematics

Проблеми задовољења ограничења, којима припадају и проблеми оптимизације, спадају у веома значајне проблеме дискретне математике са… (more)

Subjects/Keywords: constrain satisfaction problem; optimisation problem; discrete mathematics; combinatorial optimisation; exact solution; algorithm; Boolean satisfiability; Whitehead minimisation problem; berth Allocation problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kordić, Stevan Lj., 1. (2018). Метод седиментације и његове примјене у проблемима дискретне математике. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kordić, Stevan Lj., 1969-. “Метод седиментације и његове примјене у проблемима дискретне математике.” 2018. Thesis, Univerzitet u Beogradu. Accessed January 22, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kordić, Stevan Lj., 1969-. “Метод седиментације и његове примјене у проблемима дискретне математике.” 2018. Web. 22 Jan 2021.

Vancouver:

Kordić, Stevan Lj. 1. Метод седиментације и његове примјене у проблемима дискретне математике. [Internet] [Thesis]. Univerzitet u Beogradu; 2018. [cited 2021 Jan 22]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kordić, Stevan Lj. 1. Метод седиментације и његове примјене у проблемима дискретне математике. [Thesis]. Univerzitet u Beogradu; 2018. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:15359/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

21. Takiyama, Felipe Iwao. Algoritmos de inferência exata para modelos de primeira ordem.

Degree: Mestrado, Engenharia de Controle e Automação Mecânica, 2014, University of São Paulo

Este trabalho descreve a implementação de algoritmos de inferência para modelos de primeira ordem. Três algoritmos foram implementados: ve, c-fove e ac-fove. Este último e… (more)

Subjects/Keywords: AC-FOVE; AC-FOVE; Algoritmo de eliminação de variáveis em primeira ordem; Algoritmo de inferência exata; Exact inference algorithm; First-order variable elimination algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Takiyama, F. I. (2014). Algoritmos de inferência exata para modelos de primeira ordem. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/ ;

Chicago Manual of Style (16th Edition):

Takiyama, Felipe Iwao. “Algoritmos de inferência exata para modelos de primeira ordem.” 2014. Masters Thesis, University of São Paulo. Accessed January 22, 2021. http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/ ;.

MLA Handbook (7th Edition):

Takiyama, Felipe Iwao. “Algoritmos de inferência exata para modelos de primeira ordem.” 2014. Web. 22 Jan 2021.

Vancouver:

Takiyama FI. Algoritmos de inferência exata para modelos de primeira ordem. [Internet] [Masters thesis]. University of São Paulo; 2014. [cited 2021 Jan 22]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/ ;.

Council of Science Editors:

Takiyama FI. Algoritmos de inferência exata para modelos de primeira ordem. [Masters Thesis]. University of São Paulo; 2014. Available from: http://www.teses.usp.br/teses/disponiveis/3/3152/tde-23122014-145932/ ;


University of Waterloo

22. Simjour, Narges. A New Optimality Measure for Distance Dominating Sets.

Degree: 2006, University of Waterloo

 We study the problem of finding the smallest power of an input graph that has k disjoint dominating sets, where the ith power of an… (more)

Subjects/Keywords: Computer Science; distance dominating set; domatic number; approximation algorithm; exact algorithm; spanner

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simjour, N. (2006). A New Optimality Measure for Distance Dominating Sets. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2941

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Simjour, Narges. “A New Optimality Measure for Distance Dominating Sets.” 2006. Thesis, University of Waterloo. Accessed January 22, 2021. http://hdl.handle.net/10012/2941.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Simjour, Narges. “A New Optimality Measure for Distance Dominating Sets.” 2006. Web. 22 Jan 2021.

Vancouver:

Simjour N. A New Optimality Measure for Distance Dominating Sets. [Internet] [Thesis]. University of Waterloo; 2006. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10012/2941.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Simjour N. A New Optimality Measure for Distance Dominating Sets. [Thesis]. University of Waterloo; 2006. Available from: http://hdl.handle.net/10012/2941

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

23. Mameri, Djelloul. L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies.

Degree: Docteur es, Informatique, 2014, Université Blaise-Pascale, Clermont-Ferrand II

Dans ce travail, nous nous intéressons à une topologie pour les réseaux de capteurs sans fil. Un réseau de capteurs sans fil peut être modélisé… (more)

Subjects/Keywords: Ensembles dominants; Indépendant faiblement connexe; Réseaux sans fil; Algorithme d’énumération exact; Polytope; Algorithme de coupes et branchement; Dominating set; Weakly connected independent set; Wireless networks; Exact algorithm; Branch-and-cut algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mameri, D. (2014). L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2014CLF22513

Chicago Manual of Style (16th Edition):

Mameri, Djelloul. “L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies.” 2014. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed January 22, 2021. http://www.theses.fr/2014CLF22513.

MLA Handbook (7th Edition):

Mameri, Djelloul. “L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies.” 2014. Web. 22 Jan 2021.

Vancouver:

Mameri D. L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2014CLF22513.

Council of Science Editors:

Mameri D. L'indépendant faiblement connexe : études algorithmiques et polyédrales : Weakly connected independent sets : algorithmic and polyhedral studies. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2014. Available from: http://www.theses.fr/2014CLF22513


Anna University

24. Kalpana M. Design and evaluation of energy efficient hierarchical energy tree based routing and exponential congestion control algorithms for wireless sensor networks;.

Degree: 2013, Anna University

The vision of ubiquitous computing requires the development of devices and technologies which can be pervasive without being intrusive. The basic components of such a… (more)

Subjects/Keywords: Energy efficient; hierarchical energy tree; wireless sensor networks; additive increase and multiplicative decrease; Transmission Control Protocol/Exponential algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

M, K. (2013). Design and evaluation of energy efficient hierarchical energy tree based routing and exponential congestion control algorithms for wireless sensor networks;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/13410

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

M, Kalpana. “Design and evaluation of energy efficient hierarchical energy tree based routing and exponential congestion control algorithms for wireless sensor networks;.” 2013. Thesis, Anna University. Accessed January 22, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/13410.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

M, Kalpana. “Design and evaluation of energy efficient hierarchical energy tree based routing and exponential congestion control algorithms for wireless sensor networks;.” 2013. Web. 22 Jan 2021.

Vancouver:

M K. Design and evaluation of energy efficient hierarchical energy tree based routing and exponential congestion control algorithms for wireless sensor networks;. [Internet] [Thesis]. Anna University; 2013. [cited 2021 Jan 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13410.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

M K. Design and evaluation of energy efficient hierarchical energy tree based routing and exponential congestion control algorithms for wireless sensor networks;. [Thesis]. Anna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/13410

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

25. Shahab, Mohamad T. A New Approach to Multi-Model Adaptive Control.

Degree: 2020, University of Waterloo

 Adaptive control is an approach used to deal with systems with uncertain or time-varying parameters. A classical adaptive controller typically consists of a linear time-invariant… (more)

Subjects/Keywords: adaptive control; switching adaptive control; exponential stability; robust adaptive control; control theory; projection algorithm; multi-model; Adaptive control systems; Control theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shahab, M. T. (2020). A New Approach to Multi-Model Adaptive Control. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15766

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shahab, Mohamad T. “A New Approach to Multi-Model Adaptive Control.” 2020. Thesis, University of Waterloo. Accessed January 22, 2021. http://hdl.handle.net/10012/15766.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shahab, Mohamad T. “A New Approach to Multi-Model Adaptive Control.” 2020. Web. 22 Jan 2021.

Vancouver:

Shahab MT. A New Approach to Multi-Model Adaptive Control. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10012/15766.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shahab MT. A New Approach to Multi-Model Adaptive Control. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/15766

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

26. Morad, Farhad. Non-linear Curve Fitting.

Degree: Culture and Communication, 2019, Mälardalen University

The work done in this thesis is to examine various methods for curve fitting. Linear least squares and non-linear least squares will be described… (more)

Subjects/Keywords: Curve Fitting; Power-exponential function; Gauss-Newton algorithm; Levenberg-Marquardt algorithm; Linear and non-linear curve fitting; Kurvanpassning; Potens-exponential funktion; Gauss-Newton-algoritm; Levenberg-Marquardt-algoritm; Linjär och ickelinjär kurvanpassning; Other Mathematics; Annan matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morad, F. (2019). Non-linear Curve Fitting. (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-43600

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Morad, Farhad. “Non-linear Curve Fitting.” 2019. Thesis, Mälardalen University. Accessed January 22, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-43600.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Morad, Farhad. “Non-linear Curve Fitting.” 2019. Web. 22 Jan 2021.

Vancouver:

Morad F. Non-linear Curve Fitting. [Internet] [Thesis]. Mälardalen University; 2019. [cited 2021 Jan 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-43600.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Morad F. Non-linear Curve Fitting. [Thesis]. Mälardalen University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-43600

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Momège, Benjamin. Autour de la connexité dans les graphes avec conflits : On the Connectivity of Graphs with Conflicts.

Degree: Docteur es, Informatique, 2015, Université Blaise-Pascale, Clermont-Ferrand II

Nous nous intéresserons aux graphes avec conflits (un conflit est une paire d’arêtes ne pouvant pas simultanément faire partie d’un même sous-graphe), dans lesquels nous… (more)

Subjects/Keywords: Graphe; Conflit; Transition Interdite; Connexité; Chemin; Parcours; Arbre; Condition Hamiltonienne; Algorithme Exact; \mathcal{N P}-Complétude; Graph; Conflict; Forbidden Transition; Connectivity; Path; Walk; Tree; Hamiltonian Condition; Exact Algorithm; \mathcal{N P}-Completeness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Momège, B. (2015). Autour de la connexité dans les graphes avec conflits : On the Connectivity of Graphs with Conflicts. (Doctoral Dissertation). Université Blaise-Pascale, Clermont-Ferrand II. Retrieved from http://www.theses.fr/2015CLF22588

Chicago Manual of Style (16th Edition):

Momège, Benjamin. “Autour de la connexité dans les graphes avec conflits : On the Connectivity of Graphs with Conflicts.” 2015. Doctoral Dissertation, Université Blaise-Pascale, Clermont-Ferrand II. Accessed January 22, 2021. http://www.theses.fr/2015CLF22588.

MLA Handbook (7th Edition):

Momège, Benjamin. “Autour de la connexité dans les graphes avec conflits : On the Connectivity of Graphs with Conflicts.” 2015. Web. 22 Jan 2021.

Vancouver:

Momège B. Autour de la connexité dans les graphes avec conflits : On the Connectivity of Graphs with Conflicts. [Internet] [Doctoral dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2015. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2015CLF22588.

Council of Science Editors:

Momège B. Autour de la connexité dans les graphes avec conflits : On the Connectivity of Graphs with Conflicts. [Doctoral Dissertation]. Université Blaise-Pascale, Clermont-Ferrand II; 2015. Available from: http://www.theses.fr/2015CLF22588


University of Georgia

28. ZHOU, JIN. Bifurcating time series models for cell lineage data.

Degree: 2014, University of Georgia

 This dissertation studies bifurcating time series models. Our motivation comes from cell lineage data, in which each individual in a generation gives rise to two… (more)

Subjects/Keywords: Cell Lineage Data; Tree-Indexed Data; Bifurcating Autoregressive Models; Least Squares Estimation; Maximum Likelihood Estimation; Quasilikelihood Estimation; Exponential Innovations; Exact Distribution; Limit Distribution; Asymptotic Property; Non-Gaussian Models; Integer-valued Autoregression.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

ZHOU, J. (2014). Bifurcating time series models for cell lineage data. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/21737

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

ZHOU, JIN. “Bifurcating time series models for cell lineage data.” 2014. Thesis, University of Georgia. Accessed January 22, 2021. http://hdl.handle.net/10724/21737.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

ZHOU, JIN. “Bifurcating time series models for cell lineage data.” 2014. Web. 22 Jan 2021.

Vancouver:

ZHOU J. Bifurcating time series models for cell lineage data. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/10724/21737.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ZHOU J. Bifurcating time series models for cell lineage data. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/21737

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

29. Al Kharboutly, Mira. Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C. : Solving a binary quadratic problem with mixed constraints by D.C. optimization techniques.

Degree: Docteur es, Mathématiques appliquées, 2018, Normandie

Notre objectif dans cette thèse est de résoudre un problème quadratique binaire sous contraintes mixtes par les techniques d'optimisation DC. Puisque l'optimisation DC a prouvé… (more)

Subjects/Keywords: Optimisation DC; Algorithmes DC (DCA); Programmation semi-définie positive; Pénalité exacte; DC optimization; DC algorithm (DCA); Exact penalty; Quadratic programming; Nonsmooth Newton method; Semidefinite programming; Interior points methods

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al Kharboutly, M. (2018). Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C. : Solving a binary quadratic problem with mixed constraints by D.C. optimization techniques. (Doctoral Dissertation). Normandie. Retrieved from http://www.theses.fr/2018NORMLH06

Chicago Manual of Style (16th Edition):

Al Kharboutly, Mira. “Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C. : Solving a binary quadratic problem with mixed constraints by D.C. optimization techniques.” 2018. Doctoral Dissertation, Normandie. Accessed January 22, 2021. http://www.theses.fr/2018NORMLH06.

MLA Handbook (7th Edition):

Al Kharboutly, Mira. “Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C. : Solving a binary quadratic problem with mixed constraints by D.C. optimization techniques.” 2018. Web. 22 Jan 2021.

Vancouver:

Al Kharboutly M. Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C. : Solving a binary quadratic problem with mixed constraints by D.C. optimization techniques. [Internet] [Doctoral dissertation]. Normandie; 2018. [cited 2021 Jan 22]. Available from: http://www.theses.fr/2018NORMLH06.

Council of Science Editors:

Al Kharboutly M. Résolution d’un problème quadratique non convexe avec contraintes mixtes par les techniques de l’optimisation D.C. : Solving a binary quadratic problem with mixed constraints by D.C. optimization techniques. [Doctoral Dissertation]. Normandie; 2018. Available from: http://www.theses.fr/2018NORMLH06


Kyoto University / 京都大学

30. Bhusiri, Narath. EXACT SOLUTIONS FOR VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH FULL SOFT TIME WINDOWS USING COLUMN GENERATION AND LABELING ALGORITHMS : 列生成法およびラべリングアルゴリズムを用いたフルソフトタイムウィンドウ付配車配送計画の厳密解.

Degree: 博士(工学), 2013, Kyoto University / 京都大学

新制・課程博士

甲第17871号

工博第3780号

Subjects/Keywords: Freight transport; routing problem; exact solutions; column generation; labeling algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhusiri, N. (2013). EXACT SOLUTIONS FOR VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH FULL SOFT TIME WINDOWS USING COLUMN GENERATION AND LABELING ALGORITHMS : 列生成法およびラべリングアルゴリズムを用いたフルソフトタイムウィンドウ付配車配送計画の厳密解. (Thesis). Kyoto University / 京都大学. Retrieved from http://hdl.handle.net/2433/180484 ; http://dx.doi.org/10.14989/doctor.k17871

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Bhusiri, Narath. “EXACT SOLUTIONS FOR VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH FULL SOFT TIME WINDOWS USING COLUMN GENERATION AND LABELING ALGORITHMS : 列生成法およびラべリングアルゴリズムを用いたフルソフトタイムウィンドウ付配車配送計画の厳密解.” 2013. Thesis, Kyoto University / 京都大学. Accessed January 22, 2021. http://hdl.handle.net/2433/180484 ; http://dx.doi.org/10.14989/doctor.k17871.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Bhusiri, Narath. “EXACT SOLUTIONS FOR VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH FULL SOFT TIME WINDOWS USING COLUMN GENERATION AND LABELING ALGORITHMS : 列生成法およびラべリングアルゴリズムを用いたフルソフトタイムウィンドウ付配車配送計画の厳密解.” 2013. Web. 22 Jan 2021.

Vancouver:

Bhusiri N. EXACT SOLUTIONS FOR VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH FULL SOFT TIME WINDOWS USING COLUMN GENERATION AND LABELING ALGORITHMS : 列生成法およびラべリングアルゴリズムを用いたフルソフトタイムウィンドウ付配車配送計画の厳密解. [Internet] [Thesis]. Kyoto University / 京都大学; 2013. [cited 2021 Jan 22]. Available from: http://hdl.handle.net/2433/180484 ; http://dx.doi.org/10.14989/doctor.k17871.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Bhusiri N. EXACT SOLUTIONS FOR VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH FULL SOFT TIME WINDOWS USING COLUMN GENERATION AND LABELING ALGORITHMS : 列生成法およびラべリングアルゴリズムを用いたフルソフトタイムウィンドウ付配車配送計画の厳密解. [Thesis]. Kyoto University / 京都大学; 2013. Available from: http://hdl.handle.net/2433/180484 ; http://dx.doi.org/10.14989/doctor.k17871

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [282]

.