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:(Conquer). Showing records 1 – 30 of 60 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters

1. Zavershynskyi, Maksym. Higher-order Voronoi diagrams of polygonal objects.

Degree: 2014, Università della Svizzera italiana

 Higher-order Voronoi diagrams are fundamental geometric structures which encode the k-nearest neighbor information. Thus, they aid in computations that require proximity information beyond the nearest… (more)

Subjects/Keywords: Divide and conquer

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zavershynskyi, M. (2014). Higher-order Voronoi diagrams of polygonal objects. (Thesis). Università della Svizzera italiana. Retrieved from http://doc.rero.ch/record/233383

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):

Zavershynskyi, Maksym. “Higher-order Voronoi diagrams of polygonal objects.” 2014. Thesis, Università della Svizzera italiana. Accessed July 11, 2020. http://doc.rero.ch/record/233383.

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

MLA Handbook (7th Edition):

Zavershynskyi, Maksym. “Higher-order Voronoi diagrams of polygonal objects.” 2014. Web. 11 Jul 2020.

Vancouver:

Zavershynskyi M. Higher-order Voronoi diagrams of polygonal objects. [Internet] [Thesis]. Università della Svizzera italiana; 2014. [cited 2020 Jul 11]. Available from: http://doc.rero.ch/record/233383.

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

Council of Science Editors:

Zavershynskyi M. Higher-order Voronoi diagrams of polygonal objects. [Thesis]. Università della Svizzera italiana; 2014. Available from: http://doc.rero.ch/record/233383

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


University of Manchester

2. Needham, Perri. Enhancing the capabilities of computational chemistry using GPU technology.

Degree: PhD, 2013, University of Manchester

 Three key enhancements were made to a semiempirical molecular orbital program to develop a fast, accurate method of calculating chemical properties of large (> 1000… (more)

Subjects/Keywords: 542; gpu acceleration; divide-and-conquer; semiempirical

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Needham, P. (2013). Enhancing the capabilities of computational chemistry using GPU technology. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/enhancing-the-capabilities-of-computational-chemistry-using-gpu-technology(0988c19e-cc1a-443f-b82f-0c5fe0422d0b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606916

Chicago Manual of Style (16th Edition):

Needham, Perri. “Enhancing the capabilities of computational chemistry using GPU technology.” 2013. Doctoral Dissertation, University of Manchester. Accessed July 11, 2020. https://www.research.manchester.ac.uk/portal/en/theses/enhancing-the-capabilities-of-computational-chemistry-using-gpu-technology(0988c19e-cc1a-443f-b82f-0c5fe0422d0b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606916.

MLA Handbook (7th Edition):

Needham, Perri. “Enhancing the capabilities of computational chemistry using GPU technology.” 2013. Web. 11 Jul 2020.

Vancouver:

Needham P. Enhancing the capabilities of computational chemistry using GPU technology. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2020 Jul 11]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/enhancing-the-capabilities-of-computational-chemistry-using-gpu-technology(0988c19e-cc1a-443f-b82f-0c5fe0422d0b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606916.

Council of Science Editors:

Needham P. Enhancing the capabilities of computational chemistry using GPU technology. [Doctoral Dissertation]. University of Manchester; 2013. Available from: https://www.research.manchester.ac.uk/portal/en/theses/enhancing-the-capabilities-of-computational-chemistry-using-gpu-technology(0988c19e-cc1a-443f-b82f-0c5fe0422d0b).html ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.606916


Anna University

3. Sabeen S. Association rule mining using directed graphs and hypergraphs;.

Degree: Association rule mining using directed graphs and hypergraphs, 2015, Anna University

Data mining is a potential tool for prolific analysis of data The task of association rule mining in a large database is one of the… (more)

Subjects/Keywords: Data mining; Divide and conquer and a greedy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

S, S. (2015). Association rule mining using directed graphs and hypergraphs;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/39196

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):

S, Sabeen. “Association rule mining using directed graphs and hypergraphs;.” 2015. Thesis, Anna University. Accessed July 11, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/39196.

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

MLA Handbook (7th Edition):

S, Sabeen. “Association rule mining using directed graphs and hypergraphs;.” 2015. Web. 11 Jul 2020.

Vancouver:

S S. Association rule mining using directed graphs and hypergraphs;. [Internet] [Thesis]. Anna University; 2015. [cited 2020 Jul 11]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39196.

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

Council of Science Editors:

S S. Association rule mining using directed graphs and hypergraphs;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39196

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


NSYSU

4. Tseng, Chun-han. Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer.

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

 There are two research topics in this thesis. First, we implement a highly efficient Chinese input method. Second, we apply a divide-and-conquer scheme to the… (more)

Subjects/Keywords: divide-and-conquer; Chinese input method; speaker diarization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tseng, C. (2008). Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401

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):

Tseng, Chun-han. “Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer.” 2008. Thesis, NSYSU. Accessed July 11, 2020. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401.

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

MLA Handbook (7th Edition):

Tseng, Chun-han. “Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer.” 2008. Web. 11 Jul 2020.

Vancouver:

Tseng C. Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer. [Internet] [Thesis]. NSYSU; 2008. [cited 2020 Jul 11]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401.

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

Council of Science Editors:

Tseng C. Chinese Input Method Based on First Mandarin Phonetic Alphabet for Mobile Devices and an Approach in Speaker Diarization with Divide-and-Conquer. [Thesis]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909108-140401

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

5. He, Jingyi. Fitting Mixed Effects Models with Big Data.

Degree: 2017, University of California – eScholarship, University of California

 As technology evolves, big data bring us great opportunities to identify patterns which were infeasible to identify from observations before. At the same time, it… (more)

Subjects/Keywords: Statistics; Big Data; Divide and Conquer; Linear Mixed Effect Model; Subsampling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, J. (2017). Fitting Mixed Effects Models with Big Data. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/5s4156kj

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):

He, Jingyi. “Fitting Mixed Effects Models with Big Data.” 2017. Thesis, University of California – eScholarship, University of California. Accessed July 11, 2020. http://www.escholarship.org/uc/item/5s4156kj.

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

MLA Handbook (7th Edition):

He, Jingyi. “Fitting Mixed Effects Models with Big Data.” 2017. Web. 11 Jul 2020.

Vancouver:

He J. Fitting Mixed Effects Models with Big Data. [Internet] [Thesis]. University of California – eScholarship, University of California; 2017. [cited 2020 Jul 11]. Available from: http://www.escholarship.org/uc/item/5s4156kj.

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

Council of Science Editors:

He J. Fitting Mixed Effects Models with Big Data. [Thesis]. University of California – eScholarship, University of California; 2017. Available from: http://www.escholarship.org/uc/item/5s4156kj

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


Karlstad University

6. Lindberg, Malin. Födoämnesöverkänslighet : Hur pedagogerna bemöter födoämnesöverkänsliga barn i förskolan och hur de får kunskaper i ämnet.

Degree: Faculty of Arts and Social Sciences (starting 2013), 2016, Karlstad University

In this study I have investigated how educators in preschool get their knowledge about foodhypersensitivity and how they treat these children in the preschool… (more)

Subjects/Keywords: Conquer knowledge; Foodhypersensitivity; Preschool; Treatment; Bemötande; Erövra kunskap; Födoämnesöverkänslighet; Förskola

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lindberg, M. (2016). Födoämnesöverkänslighet : Hur pedagogerna bemöter födoämnesöverkänsliga barn i förskolan och hur de får kunskaper i ämnet. (Thesis). Karlstad University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-43649

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):

Lindberg, Malin. “Födoämnesöverkänslighet : Hur pedagogerna bemöter födoämnesöverkänsliga barn i förskolan och hur de får kunskaper i ämnet.” 2016. Thesis, Karlstad University. Accessed July 11, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-43649.

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

MLA Handbook (7th Edition):

Lindberg, Malin. “Födoämnesöverkänslighet : Hur pedagogerna bemöter födoämnesöverkänsliga barn i förskolan och hur de får kunskaper i ämnet.” 2016. Web. 11 Jul 2020.

Vancouver:

Lindberg M. Födoämnesöverkänslighet : Hur pedagogerna bemöter födoämnesöverkänsliga barn i förskolan och hur de får kunskaper i ämnet. [Internet] [Thesis]. Karlstad University; 2016. [cited 2020 Jul 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-43649.

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

Council of Science Editors:

Lindberg M. Födoämnesöverkänslighet : Hur pedagogerna bemöter födoämnesöverkänsliga barn i förskolan och hur de får kunskaper i ämnet. [Thesis]. Karlstad University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-43649

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


Texas A&M University

7. Yu, Fangqing. A divide-and-conquer method for 3D capacitance extraction.

Degree: 2004, Texas A&M University

 This thesis describes a divide-and-conquer algorithm to improve the 3D boundary element method (BEM) for capacitance extraction. We divide large interconnect structures into small sections,… (more)

Subjects/Keywords: Capacitance Extraction; Divide-and-Conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yu, F. (2004). A divide-and-conquer method for 3D capacitance extraction. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/166

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):

Yu, Fangqing. “A divide-and-conquer method for 3D capacitance extraction.” 2004. Thesis, Texas A&M University. Accessed July 11, 2020. http://hdl.handle.net/1969.1/166.

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

MLA Handbook (7th Edition):

Yu, Fangqing. “A divide-and-conquer method for 3D capacitance extraction.” 2004. Web. 11 Jul 2020.

Vancouver:

Yu F. A divide-and-conquer method for 3D capacitance extraction. [Internet] [Thesis]. Texas A&M University; 2004. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1969.1/166.

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

Council of Science Editors:

Yu F. A divide-and-conquer method for 3D capacitance extraction. [Thesis]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/166

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


University of Vienna

8. Felsner, Kastor Maximilian. On implementation and evaluation of a divide & conquer eigensolver for the real bandsymmetric eigenproblem and comparison to current methods.

Degree: 2018, University of Vienna

Die fortlaufende Weiterentwicklung moderner Computerarchitekturen fordert eine stetige Anpassung numerischer Software. Um die Rechenleistung heutiger Systeme auszunutzen müssen Algorithmen ein hohes Maß an Parallelität aufweisen.… (more)

Subjects/Keywords: 54.00 Informatik: Allgemeines; 31.76 Numerische Mathematik; Eigenwertproblem / Bandmatrix / symmetrisch / divide and conquer / Tridiagonalisierung; eigensolver / eigenproblem / band matrix / symmetric / divide and conquer / tridiagonal reduction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Felsner, K. M. (2018). On implementation and evaluation of a divide & conquer eigensolver for the real bandsymmetric eigenproblem and comparison to current methods. (Thesis). University of Vienna. Retrieved from http://othes.univie.ac.at/54720/

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):

Felsner, Kastor Maximilian. “On implementation and evaluation of a divide & conquer eigensolver for the real bandsymmetric eigenproblem and comparison to current methods.” 2018. Thesis, University of Vienna. Accessed July 11, 2020. http://othes.univie.ac.at/54720/.

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

MLA Handbook (7th Edition):

Felsner, Kastor Maximilian. “On implementation and evaluation of a divide & conquer eigensolver for the real bandsymmetric eigenproblem and comparison to current methods.” 2018. Web. 11 Jul 2020.

Vancouver:

Felsner KM. On implementation and evaluation of a divide & conquer eigensolver for the real bandsymmetric eigenproblem and comparison to current methods. [Internet] [Thesis]. University of Vienna; 2018. [cited 2020 Jul 11]. Available from: http://othes.univie.ac.at/54720/.

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

Council of Science Editors:

Felsner KM. On implementation and evaluation of a divide & conquer eigensolver for the real bandsymmetric eigenproblem and comparison to current methods. [Thesis]. University of Vienna; 2018. Available from: http://othes.univie.ac.at/54720/

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


Texas A&M University

9. Su, Zhouzhou. Improving Design Optimization and Optimization-based Design Knowledge Discovery.

Degree: 2015, Texas A&M University

 The use of design optimization in the early stages of architectural design process has attracted a high volume of research in recent years. However, traditional… (more)

Subjects/Keywords: Design Optimization; Building Simulation; Genetic Algorithm; Time Complexity; Offline Simulation; Divide and Conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Su, Z. (2015). Improving Design Optimization and Optimization-based Design Knowledge Discovery. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155582

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):

Su, Zhouzhou. “Improving Design Optimization and Optimization-based Design Knowledge Discovery.” 2015. Thesis, Texas A&M University. Accessed July 11, 2020. http://hdl.handle.net/1969.1/155582.

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

MLA Handbook (7th Edition):

Su, Zhouzhou. “Improving Design Optimization and Optimization-based Design Knowledge Discovery.” 2015. Web. 11 Jul 2020.

Vancouver:

Su Z. Improving Design Optimization and Optimization-based Design Knowledge Discovery. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1969.1/155582.

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

Council of Science Editors:

Su Z. Improving Design Optimization and Optimization-based Design Knowledge Discovery. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155582

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

10. Guo, Long. Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle. : Sequential and parallel resolution of the problem of propositionnal satistifiability.

Degree: Docteur es, Informatique, 2013, Université d'Artois

Cette thèse porte sur la résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle(SAT). Ce problème important sur le plan théorique admet de nombreuses… (more)

Subjects/Keywords: SAT; CDCL; Résolution parallèle; Portfolio; Diviser pour régner; Parallel solver; Divider and conquer; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Guo, L. (2013). Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle. : Sequential and parallel resolution of the problem of propositionnal satistifiability. (Doctoral Dissertation). Université d'Artois. Retrieved from http://www.theses.fr/2013ARTO0408

Chicago Manual of Style (16th Edition):

Guo, Long. “Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle. : Sequential and parallel resolution of the problem of propositionnal satistifiability.” 2013. Doctoral Dissertation, Université d'Artois. Accessed July 11, 2020. http://www.theses.fr/2013ARTO0408.

MLA Handbook (7th Edition):

Guo, Long. “Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle. : Sequential and parallel resolution of the problem of propositionnal satistifiability.” 2013. Web. 11 Jul 2020.

Vancouver:

Guo L. Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle. : Sequential and parallel resolution of the problem of propositionnal satistifiability. [Internet] [Doctoral dissertation]. Université d'Artois; 2013. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2013ARTO0408.

Council of Science Editors:

Guo L. Résolution séquentielle et parallèle du problème de la satisfiabilité propositionnelle. : Sequential and parallel resolution of the problem of propositionnal satistifiability. [Doctoral Dissertation]. Université d'Artois; 2013. Available from: http://www.theses.fr/2013ARTO0408

11. G. DI LIBERTO. NEW SEMICLASSICAL THEORIES FOR VIBRATIONAL SPECTROSCOPY.

Degree: 2019, Università degli Studi di Milano

 The main goal of this doctoral work was to develop theoretical advances of the semiclassical theory applied to molecular spectroscopy. In particular, the attention was… (more)

Subjects/Keywords: Semiclassical; Vibrational Spectroscopy; Divide and Conquer; Molecular dynamics; Settore CHIM/02 - Chimica Fisica

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

LIBERTO, G. D. (2019). NEW SEMICLASSICAL THEORIES FOR VIBRATIONAL SPECTROSCOPY. (Thesis). Università degli Studi di Milano. Retrieved from http://hdl.handle.net/2434/612134

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):

LIBERTO, G. DI. “NEW SEMICLASSICAL THEORIES FOR VIBRATIONAL SPECTROSCOPY.” 2019. Thesis, Università degli Studi di Milano. Accessed July 11, 2020. http://hdl.handle.net/2434/612134.

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

MLA Handbook (7th Edition):

LIBERTO, G. DI. “NEW SEMICLASSICAL THEORIES FOR VIBRATIONAL SPECTROSCOPY.” 2019. Web. 11 Jul 2020.

Vancouver:

LIBERTO GD. NEW SEMICLASSICAL THEORIES FOR VIBRATIONAL SPECTROSCOPY. [Internet] [Thesis]. Università degli Studi di Milano; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/2434/612134.

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

Council of Science Editors:

LIBERTO GD. NEW SEMICLASSICAL THEORIES FOR VIBRATIONAL SPECTROSCOPY. [Thesis]. Università degli Studi di Milano; 2019. Available from: http://hdl.handle.net/2434/612134

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


University of Illinois – Chicago

12. Li, Keren. Score-Matching Representative Approach for Big Data Analysis with Generalized Linear Models.

Degree: 2018, University of Illinois – Chicago

 We propose a fast and efficient strategy, called the representative approach, with linear models and generalized linear models for big data analysis, and in particular… (more)

Subjects/Keywords: Big data; GLM; Representative approach; SMR; MR; Divide and conquer; Subsampling; Distributed database

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, K. (2018). Score-Matching Representative Approach for Big Data Analysis with Generalized Linear Models. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/23136

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):

Li, Keren. “Score-Matching Representative Approach for Big Data Analysis with Generalized Linear Models.” 2018. Thesis, University of Illinois – Chicago. Accessed July 11, 2020. http://hdl.handle.net/10027/23136.

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

MLA Handbook (7th Edition):

Li, Keren. “Score-Matching Representative Approach for Big Data Analysis with Generalized Linear Models.” 2018. Web. 11 Jul 2020.

Vancouver:

Li K. Score-Matching Representative Approach for Big Data Analysis with Generalized Linear Models. [Internet] [Thesis]. University of Illinois – Chicago; 2018. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10027/23136.

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

Council of Science Editors:

Li K. Score-Matching Representative Approach for Big Data Analysis with Generalized Linear Models. [Thesis]. University of Illinois – Chicago; 2018. Available from: http://hdl.handle.net/10027/23136

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

13. Needham, Perri Jane. Enhancing the Capabilities of Computational Chemistry using GPU Technology.

Degree: 2013, University of Manchester

 The research documented in this thesis, Enhancing the Capabilities of Computational Chemistry using GPU Technology, has been carried out by Perri Needham at the University… (more)

Subjects/Keywords: gpu acceleration; divide-and-conquer; semiempirical

…enhancements are presented which are: the implementation of a divide-and-conquer approach to a self… …GPU technology, to parallelize the divide-and-conquer self-consistent field procedure, in an… …divide-and-conquer approach to the SCF (DC-SCF) procedure (enhancement 1)… …field (SCF)-energy. The new algorithm uses the divide-and-conquer approach to… …parallel divide-and-conquer self-consistent field (DC-SCF) algorithm for use on a GPU… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Needham, P. J. (2013). Enhancing the Capabilities of Computational Chemistry using GPU Technology. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:211646

Chicago Manual of Style (16th Edition):

Needham, Perri Jane. “Enhancing the Capabilities of Computational Chemistry using GPU Technology.” 2013. Doctoral Dissertation, University of Manchester. Accessed July 11, 2020. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:211646.

MLA Handbook (7th Edition):

Needham, Perri Jane. “Enhancing the Capabilities of Computational Chemistry using GPU Technology.” 2013. Web. 11 Jul 2020.

Vancouver:

Needham PJ. Enhancing the Capabilities of Computational Chemistry using GPU Technology. [Internet] [Doctoral dissertation]. University of Manchester; 2013. [cited 2020 Jul 11]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:211646.

Council of Science Editors:

Needham PJ. Enhancing the Capabilities of Computational Chemistry using GPU Technology. [Doctoral Dissertation]. University of Manchester; 2013. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:211646


University of California – Berkeley

14. Mukherjee, Soumendu Sundar. On Some Inference Problems for Networks.

Degree: Statistics, 2018, University of California – Berkeley

 Networks are abstract representations of relationships between a set of entities. As such they can be used to represent data in a variety of complex… (more)

Subjects/Keywords: Statistics; Mathematics; Computer science; Changepoint detection; Community detection; Divide and conquer; Mixed membership estimation; Network comparison; Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mukherjee, S. S. (2018). On Some Inference Problems for Networks. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/4019f6kj

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):

Mukherjee, Soumendu Sundar. “On Some Inference Problems for Networks.” 2018. Thesis, University of California – Berkeley. Accessed July 11, 2020. http://www.escholarship.org/uc/item/4019f6kj.

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

MLA Handbook (7th Edition):

Mukherjee, Soumendu Sundar. “On Some Inference Problems for Networks.” 2018. Web. 11 Jul 2020.

Vancouver:

Mukherjee SS. On Some Inference Problems for Networks. [Internet] [Thesis]. University of California – Berkeley; 2018. [cited 2020 Jul 11]. Available from: http://www.escholarship.org/uc/item/4019f6kj.

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

Council of Science Editors:

Mukherjee SS. On Some Inference Problems for Networks. [Thesis]. University of California – Berkeley; 2018. Available from: http://www.escholarship.org/uc/item/4019f6kj

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


University of New South Wales

15. Li, Zheng. A qualitative approach to effort judgment for web service composition based SOA implementations.

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

 Before developing any Service-Oriented Architecture (SOA) based software, effort estimation will be inevitably required for many purposes ranging from budget analysis to cost-benefit balance. Therefore,… (more)

Subjects/Keywords: Organization Theory; Software Effort Estimation; Service-Oriented Architecture (SOA); Divide-and-Conquer (D&C); Circumstantial-Evidence-Based Judgment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, Z. (2011). A qualitative approach to effort judgment for web service composition based SOA implementations. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/50975 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9869/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Li, Zheng. “A qualitative approach to effort judgment for web service composition based SOA implementations.” 2011. Masters Thesis, University of New South Wales. Accessed July 11, 2020. http://handle.unsw.edu.au/1959.4/50975 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9869/SOURCE02?view=true.

MLA Handbook (7th Edition):

Li, Zheng. “A qualitative approach to effort judgment for web service composition based SOA implementations.” 2011. Web. 11 Jul 2020.

Vancouver:

Li Z. A qualitative approach to effort judgment for web service composition based SOA implementations. [Internet] [Masters thesis]. University of New South Wales; 2011. [cited 2020 Jul 11]. Available from: http://handle.unsw.edu.au/1959.4/50975 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9869/SOURCE02?view=true.

Council of Science Editors:

Li Z. A qualitative approach to effort judgment for web service composition based SOA implementations. [Masters Thesis]. University of New South Wales; 2011. Available from: http://handle.unsw.edu.au/1959.4/50975 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:9869/SOURCE02?view=true


Texas A&M University

16. Qiu, Zhiquan Frank. Advance the DNA computing.

Degree: 2004, Texas A&M University

 It has been previously shown that DNA computing can solve those problems currently intractable on even the fastest electronic computers. The algorithm design for DNA… (more)

Subjects/Keywords: DNA Computing; Parallel Computing; Molecular Computing; Divide and Conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qiu, Z. F. (2004). Advance the DNA computing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/568

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):

Qiu, Zhiquan Frank. “Advance the DNA computing.” 2004. Thesis, Texas A&M University. Accessed July 11, 2020. http://hdl.handle.net/1969.1/568.

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

MLA Handbook (7th Edition):

Qiu, Zhiquan Frank. “Advance the DNA computing.” 2004. Web. 11 Jul 2020.

Vancouver:

Qiu ZF. Advance the DNA computing. [Internet] [Thesis]. Texas A&M University; 2004. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1969.1/568.

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

Council of Science Editors:

Qiu ZF. Advance the DNA computing. [Thesis]. Texas A&M University; 2004. Available from: http://hdl.handle.net/1969.1/568

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


Kyoto University / 京都大学

17. 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 July 11, 2020. 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. 11 Jul 2020.

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs : 次数の制限されたグラフにおけるトラベリングセールスマン問題に対する多項式領域厳密アルゴリズム. [Internet] [Thesis]. Kyoto University / 京都大学; 2017. [cited 2020 Jul 11]. 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

18. 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 July 11, 2020. 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. 11 Jul 2020.

Vancouver:

Norhazwani MY. Polynomial-Space Exact Algorithms for Traveling Salesman Problem in Degree Bounded Graphs . [Internet] [Thesis]. Kyoto University; 2017. [cited 2020 Jul 11]. 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

19. Vu, Hoang Hiep. Large-scale and high-quality multi-view stereo : Stéréo multi-vues à grande-échelle et de haute-qualité.

Degree: Docteur es, Informatique, 2011, Université Paris-Est

L'acquisition de modèles 3D des scènes réelles trouve son utilité dans de nombreuses applications pratiques, comme l'archivage numérique, les jeux vidéo, l'ingénierie, la publicité. Il… (more)

Subjects/Keywords: Stéréo multi-vue; Grande échelle; Haute précision; Fusion des maillages; Diviser pour régner; Gpu; Multi-view stereo; Large scale; High accuracy; Mesh merging; Divide and conquer; Gpu

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vu, H. H. (2011). Large-scale and high-quality multi-view stereo : Stéréo multi-vues à grande-échelle et de haute-qualité. (Doctoral Dissertation). Université Paris-Est. Retrieved from http://www.theses.fr/2011PEST1058

Chicago Manual of Style (16th Edition):

Vu, Hoang Hiep. “Large-scale and high-quality multi-view stereo : Stéréo multi-vues à grande-échelle et de haute-qualité.” 2011. Doctoral Dissertation, Université Paris-Est. Accessed July 11, 2020. http://www.theses.fr/2011PEST1058.

MLA Handbook (7th Edition):

Vu, Hoang Hiep. “Large-scale and high-quality multi-view stereo : Stéréo multi-vues à grande-échelle et de haute-qualité.” 2011. Web. 11 Jul 2020.

Vancouver:

Vu HH. Large-scale and high-quality multi-view stereo : Stéréo multi-vues à grande-échelle et de haute-qualité. [Internet] [Doctoral dissertation]. Université Paris-Est; 2011. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2011PEST1058.

Council of Science Editors:

Vu HH. Large-scale and high-quality multi-view stereo : Stéréo multi-vues à grande-échelle et de haute-qualité. [Doctoral Dissertation]. Université Paris-Est; 2011. Available from: http://www.theses.fr/2011PEST1058


Australian National University

20. Reid, David. Calculating the NMR Chemical Shielding of Large Molecules .

Degree: 2017, Australian National University

 This thesis examines three approximations that significantly reduce the computational time of theoretical NMR shielding calculations for large molecules, whilst largely retaining the accuracy of… (more)

Subjects/Keywords: NMR; nuclear magnetic resonance; chemical shielding; theoretical; prediction; proteins; large molecule; fragmentation; locally dense basis set; composite method; linear scaling; divide and conquer; hydrogen bonding; long range; McConnell correction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reid, D. (2017). Calculating the NMR Chemical Shielding of Large Molecules . (Thesis). Australian National University. Retrieved from http://hdl.handle.net/1885/133669

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):

Reid, David. “Calculating the NMR Chemical Shielding of Large Molecules .” 2017. Thesis, Australian National University. Accessed July 11, 2020. http://hdl.handle.net/1885/133669.

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

MLA Handbook (7th Edition):

Reid, David. “Calculating the NMR Chemical Shielding of Large Molecules .” 2017. Web. 11 Jul 2020.

Vancouver:

Reid D. Calculating the NMR Chemical Shielding of Large Molecules . [Internet] [Thesis]. Australian National University; 2017. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/1885/133669.

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

Council of Science Editors:

Reid D. Calculating the NMR Chemical Shielding of Large Molecules . [Thesis]. Australian National University; 2017. Available from: http://hdl.handle.net/1885/133669

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

21. TRINH NGOC THANH. Evolutionary divide-and-conquer strategy for identification of structural systems and moving forces.

Degree: 2010, National University of Singapore

Subjects/Keywords: System identification; structural dynamics; substructure; divide-and-conquer; genetic algorithm; moving force identification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

THANH, T. N. (2010). Evolutionary divide-and-conquer strategy for identification of structural systems and moving forces. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/20976

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):

THANH, TRINH NGOC. “Evolutionary divide-and-conquer strategy for identification of structural systems and moving forces.” 2010. Thesis, National University of Singapore. Accessed July 11, 2020. http://scholarbank.nus.edu.sg/handle/10635/20976.

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

MLA Handbook (7th Edition):

THANH, TRINH NGOC. “Evolutionary divide-and-conquer strategy for identification of structural systems and moving forces.” 2010. Web. 11 Jul 2020.

Vancouver:

THANH TN. Evolutionary divide-and-conquer strategy for identification of structural systems and moving forces. [Internet] [Thesis]. National University of Singapore; 2010. [cited 2020 Jul 11]. Available from: http://scholarbank.nus.edu.sg/handle/10635/20976.

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

Council of Science Editors:

THANH TN. Evolutionary divide-and-conquer strategy for identification of structural systems and moving forces. [Thesis]. National University of Singapore; 2010. Available from: http://scholarbank.nus.edu.sg/handle/10635/20976

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


University of New Orleans

22. Oprisan, Sorinel. A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding.

Degree: MS, Computer Science, 2005, University of New Orleans

 We used a divide-and-conquer algorithm to recursively solve the two-dimensional problem of protein folding of an HP sequence with the maximum number of H-H contacts.… (more)

Subjects/Keywords: Planar graphs; Divide and conquer; HP model; Algorithmic complexity; Grid graphs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oprisan, S. (2005). A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding. (Thesis). University of New Orleans. Retrieved from https://scholarworks.uno.edu/td/238

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):

Oprisan, Sorinel. “A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding.” 2005. Thesis, University of New Orleans. Accessed July 11, 2020. https://scholarworks.uno.edu/td/238.

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

MLA Handbook (7th Edition):

Oprisan, Sorinel. “A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding.” 2005. Web. 11 Jul 2020.

Vancouver:

Oprisan S. A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding. [Internet] [Thesis]. University of New Orleans; 2005. [cited 2020 Jul 11]. Available from: https://scholarworks.uno.edu/td/238.

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

Council of Science Editors:

Oprisan S. A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding. [Thesis]. University of New Orleans; 2005. Available from: https://scholarworks.uno.edu/td/238

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


New Jersey Institute of Technology

23. Min, Hua. Structural auditing methodologies for controlled terminologies.

Degree: PhD, Computer Science, 2006, New Jersey Institute of Technology

  Several auditing methodologies for large controlled terminologies are developed. These are applied to the Unified Medical Language System XXXX and the National Cancer Institute… (more)

Subjects/Keywords: Controlled terminology; Quality assurance; Inheritance; Auditing; Abstraction networks; Divide and conquer; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Min, H. (2006). Structural auditing methodologies for controlled terminologies. (Doctoral Dissertation). New Jersey Institute of Technology. Retrieved from https://digitalcommons.njit.edu/dissertations/775

Chicago Manual of Style (16th Edition):

Min, Hua. “Structural auditing methodologies for controlled terminologies.” 2006. Doctoral Dissertation, New Jersey Institute of Technology. Accessed July 11, 2020. https://digitalcommons.njit.edu/dissertations/775.

MLA Handbook (7th Edition):

Min, Hua. “Structural auditing methodologies for controlled terminologies.” 2006. Web. 11 Jul 2020.

Vancouver:

Min H. Structural auditing methodologies for controlled terminologies. [Internet] [Doctoral dissertation]. New Jersey Institute of Technology; 2006. [cited 2020 Jul 11]. Available from: https://digitalcommons.njit.edu/dissertations/775.

Council of Science Editors:

Min H. Structural auditing methodologies for controlled terminologies. [Doctoral Dissertation]. New Jersey Institute of Technology; 2006. Available from: https://digitalcommons.njit.edu/dissertations/775


Luleå University of Technology

24. Hellström, Pär. Efficient algorithms for eigenvalue problems.

Degree: 2001, Luleå University of Technology

In computational science symmetric eigenvalue problems are central and the need for fast and accurate algorithms are high. When solving a symmetric eigenvalue problem… (more)

Subjects/Keywords: Technology; Eigenvalues; Symmetric; Tridiagonal; Divide; Conquer; Dhillon; Eigenvectors; Numerical Linear Algebra; Teknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hellström, P. (2001). Efficient algorithms for eigenvalue problems. (Thesis). Luleå University of Technology. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476

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):

Hellström, Pär. “Efficient algorithms for eigenvalue problems.” 2001. Thesis, Luleå University of Technology. Accessed July 11, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476.

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

MLA Handbook (7th Edition):

Hellström, Pär. “Efficient algorithms for eigenvalue problems.” 2001. Web. 11 Jul 2020.

Vancouver:

Hellström P. Efficient algorithms for eigenvalue problems. [Internet] [Thesis]. Luleå University of Technology; 2001. [cited 2020 Jul 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476.

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

Council of Science Editors:

Hellström P. Efficient algorithms for eigenvalue problems. [Thesis]. Luleå University of Technology; 2001. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-47476

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

25. Moghaddam, Kianosh Moshir. Automated Reasoning Support for Invasive Interactive Parallelization.

Degree: The Institute of Technology, 2012, Linköping UniversityLinköping University

  To parallelize a sequential source code, a parallelization strategy must be defined that transforms the sequential source code into an equivalent parallel version. Since… (more)

Subjects/Keywords: Multi-processors; Dependence Analysis; Code parallelization; Semi-automatic parallelization; IIP; ISC; OpenMP; MPI; Artificial Intelligence; Reasoning; Decision Tree; Divide and Conquer (D&C) algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moghaddam, K. M. (2012). Automated Reasoning Support for Invasive Interactive Parallelization. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-84830

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):

Moghaddam, Kianosh Moshir. “Automated Reasoning Support for Invasive Interactive Parallelization.” 2012. Thesis, Linköping UniversityLinköping University. Accessed July 11, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-84830.

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

MLA Handbook (7th Edition):

Moghaddam, Kianosh Moshir. “Automated Reasoning Support for Invasive Interactive Parallelization.” 2012. Web. 11 Jul 2020.

Vancouver:

Moghaddam KM. Automated Reasoning Support for Invasive Interactive Parallelization. [Internet] [Thesis]. Linköping UniversityLinköping University; 2012. [cited 2020 Jul 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-84830.

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

Council of Science Editors:

Moghaddam KM. Automated Reasoning Support for Invasive Interactive Parallelization. [Thesis]. Linköping UniversityLinköping University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-84830

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


KTH

26. Abrahamsson, Felix. Designing a Question Answering System in the Domain of Swedish Technical Consulting Using Deep Learning.

Degree: Electrical Engineering and Computer Science (EECS), 2018, KTH

Question Answering systems are greatly sought after in many areas of industry. Unfortunately, as most research in Natural Language Processing is conducted in English,… (more)

Subjects/Keywords: Question Answering; Deep Learning; Machine Learning; Transfer Learning; Natural Language Processing; Technical Consulting; Word Embeddings; Divide and Conquer; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Abrahamsson, F. (2018). Designing a Question Answering System in the Domain of Swedish Technical Consulting Using Deep Learning. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231586

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):

Abrahamsson, Felix. “Designing a Question Answering System in the Domain of Swedish Technical Consulting Using Deep Learning.” 2018. Thesis, KTH. Accessed July 11, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231586.

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

MLA Handbook (7th Edition):

Abrahamsson, Felix. “Designing a Question Answering System in the Domain of Swedish Technical Consulting Using Deep Learning.” 2018. Web. 11 Jul 2020.

Vancouver:

Abrahamsson F. Designing a Question Answering System in the Domain of Swedish Technical Consulting Using Deep Learning. [Internet] [Thesis]. KTH; 2018. [cited 2020 Jul 11]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231586.

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

Council of Science Editors:

Abrahamsson F. Designing a Question Answering System in the Domain of Swedish Technical Consulting Using Deep Learning. [Thesis]. KTH; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-231586

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


Brno University of Technology

27. Chaloupka, Luděk. Aplikace Voroného diagramů v plánování dráhy robotu: Application of Voronoi Diagrams in Robot Motion Planning.

Degree: 2019, Brno University of Technology

 This bachelor thesis is focused on the theme of robot motion planning. The motion of dimensionless (i.e. point) robot without any restriction of motion and… (more)

Subjects/Keywords: Voroného diagram; inkrementální algoritmus; zametací algoritmus; algoritmus rozděl a panuj; Dijkstrův algoritmus; A* algoritmus; Voronoi diagram; incremental algorithm; plane sweep algorithm; divide and conquer algorithm; Dijkstra algorithm; A* algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chaloupka, L. (2019). Aplikace Voroného diagramů v plánování dráhy robotu: Application of Voronoi Diagrams in Robot Motion Planning. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/14290

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):

Chaloupka, Luděk. “Aplikace Voroného diagramů v plánování dráhy robotu: Application of Voronoi Diagrams in Robot Motion Planning.” 2019. Thesis, Brno University of Technology. Accessed July 11, 2020. http://hdl.handle.net/11012/14290.

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

MLA Handbook (7th Edition):

Chaloupka, Luděk. “Aplikace Voroného diagramů v plánování dráhy robotu: Application of Voronoi Diagrams in Robot Motion Planning.” 2019. Web. 11 Jul 2020.

Vancouver:

Chaloupka L. Aplikace Voroného diagramů v plánování dráhy robotu: Application of Voronoi Diagrams in Robot Motion Planning. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/11012/14290.

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

Council of Science Editors:

Chaloupka L. Aplikace Voroného diagramů v plánování dráhy robotu: Application of Voronoi Diagrams in Robot Motion Planning. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/14290

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

28. Thebault, Loïc. Algorithmes Parallèles Efficaces Appliqués aux Calculs sur Maillages Non Structurés : Scalable and Efficient Algorithms for Unstructured Mesh Computations.

Degree: Docteur es, Informatique, 2016, Université Paris-Saclay (ComUE)

Le besoin croissant en simulation a conduit à l’élaboration de supercalculateurs complexes et d’un nombre croissant de logiciels hautement parallèles. Ces supercalculateurs requièrent un rendement… (more)

Subjects/Keywords: Algorithme; Parallélisme; Diviser et conquérir; Maillage non structuré; Vectorisation; Méthode d'éléments finis; Algorithm; Parallelism; Divide-And-Conquer; Unstructured mesh; Vectorization; Finite element method; 004.35

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thebault, L. (2016). Algorithmes Parallèles Efficaces Appliqués aux Calculs sur Maillages Non Structurés : Scalable and Efficient Algorithms for Unstructured Mesh Computations. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2016SACLV088

Chicago Manual of Style (16th Edition):

Thebault, Loïc. “Algorithmes Parallèles Efficaces Appliqués aux Calculs sur Maillages Non Structurés : Scalable and Efficient Algorithms for Unstructured Mesh Computations.” 2016. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed July 11, 2020. http://www.theses.fr/2016SACLV088.

MLA Handbook (7th Edition):

Thebault, Loïc. “Algorithmes Parallèles Efficaces Appliqués aux Calculs sur Maillages Non Structurés : Scalable and Efficient Algorithms for Unstructured Mesh Computations.” 2016. Web. 11 Jul 2020.

Vancouver:

Thebault L. Algorithmes Parallèles Efficaces Appliqués aux Calculs sur Maillages Non Structurés : Scalable and Efficient Algorithms for Unstructured Mesh Computations. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2016. [cited 2020 Jul 11]. Available from: http://www.theses.fr/2016SACLV088.

Council of Science Editors:

Thebault L. Algorithmes Parallèles Efficaces Appliqués aux Calculs sur Maillages Non Structurés : Scalable and Efficient Algorithms for Unstructured Mesh Computations. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2016. Available from: http://www.theses.fr/2016SACLV088


University of Alberta

29. Santana de Lelis, Lelis H. Cluster-and-Conquer: a Paradigm for Solving State-Space Problems.

Degree: PhD, Department of Computing Science, 2013, University of Alberta

 Many important problems can be cast as state-space problems. In this dissertation we study a general paradigm for solving state-space problems which we name Cluster-and-Conquer(more)

Subjects/Keywords: Stratified Sampling; Type System; Active Stratified Sampling; Suboptimal Path-Planning; Tree Size Prediction; Planning; Artificial Intelligence; Optimal Solution Cost Prediction; Predicting Search Performance; Learning Heuristic Functions; Heuristic Search; Cluster-and-Conquer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Santana de Lelis, L. H. (2013). Cluster-and-Conquer: a Paradigm for Solving State-Space Problems. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/0v838145w

Chicago Manual of Style (16th Edition):

Santana de Lelis, Lelis H. “Cluster-and-Conquer: a Paradigm for Solving State-Space Problems.” 2013. Doctoral Dissertation, University of Alberta. Accessed July 11, 2020. https://era.library.ualberta.ca/files/0v838145w.

MLA Handbook (7th Edition):

Santana de Lelis, Lelis H. “Cluster-and-Conquer: a Paradigm for Solving State-Space Problems.” 2013. Web. 11 Jul 2020.

Vancouver:

Santana de Lelis LH. Cluster-and-Conquer: a Paradigm for Solving State-Space Problems. [Internet] [Doctoral dissertation]. University of Alberta; 2013. [cited 2020 Jul 11]. Available from: https://era.library.ualberta.ca/files/0v838145w.

Council of Science Editors:

Santana de Lelis LH. Cluster-and-Conquer: a Paradigm for Solving State-Space Problems. [Doctoral Dissertation]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/0v838145w


Universidade do Rio Grande do Sul

30. Pezzi, Guilherme Peretti. Escalonamento Work-Stealing de programas Divisão-e-Conquista com MPI-2.

Degree: 2006, Universidade do Rio Grande do Sul

Com o objetivo de ser portável e eficiente em arquiteturas HPC atuais, a execução de um programa paralelo deve ser adaptável. Este trabalho mostra como… (more)

Subjects/Keywords: Parallel programming; Processamento paralelo; Programming environments; Mpi; Divide-and-conquer; Work-stealing; MPI-2

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pezzi, G. P. (2006). Escalonamento Work-Stealing de programas Divisão-e-Conquista com MPI-2. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/8613

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):

Pezzi, Guilherme Peretti. “Escalonamento Work-Stealing de programas Divisão-e-Conquista com MPI-2.” 2006. Thesis, Universidade do Rio Grande do Sul. Accessed July 11, 2020. http://hdl.handle.net/10183/8613.

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

MLA Handbook (7th Edition):

Pezzi, Guilherme Peretti. “Escalonamento Work-Stealing de programas Divisão-e-Conquista com MPI-2.” 2006. Web. 11 Jul 2020.

Vancouver:

Pezzi GP. Escalonamento Work-Stealing de programas Divisão-e-Conquista com MPI-2. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2006. [cited 2020 Jul 11]. Available from: http://hdl.handle.net/10183/8613.

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

Council of Science Editors:

Pezzi GP. Escalonamento Work-Stealing de programas Divisão-e-Conquista com MPI-2. [Thesis]. Universidade do Rio Grande do Sul; 2006. Available from: http://hdl.handle.net/10183/8613

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

[1] [2]

.