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:(best first deterministic algorithm). Showing records 1 – 30 of 14199 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters

1. LI KAI. Development of computational methods for the rapid determination of NMR resonance assignment of large proteins.

Degree: 2004, National University of Singapore

Subjects/Keywords: protein NMR; automated resonance assignment; TROSY; secondary structure; best-first deterministic algorithm; exhaustive search algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

KAI, L. (2004). Development of computational methods for the rapid determination of NMR resonance assignment of large proteins. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13659

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

KAI, LI. “Development of computational methods for the rapid determination of NMR resonance assignment of large proteins.” 2004. Thesis, National University of Singapore. Accessed December 15, 2019. http://scholarbank.nus.edu.sg/handle/10635/13659.

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

MLA Handbook (7th Edition):

KAI, LI. “Development of computational methods for the rapid determination of NMR resonance assignment of large proteins.” 2004. Web. 15 Dec 2019.

Vancouver:

KAI L. Development of computational methods for the rapid determination of NMR resonance assignment of large proteins. [Internet] [Thesis]. National University of Singapore; 2004. [cited 2019 Dec 15]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13659.

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

Council of Science Editors:

KAI L. Development of computational methods for the rapid determination of NMR resonance assignment of large proteins. [Thesis]. National University of Singapore; 2004. Available from: http://scholarbank.nus.edu.sg/handle/10635/13659

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


University of Illinois – Urbana-Champaign

2. Parekh, Pratik Mayur. Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects.

Degree: MS, Mechanical Engineering, 2015, University of Illinois – Urbana-Champaign

 The deterministic annealing (DA) method, used for the solution of several nonconvex problems, offers the ability to avoid shallow local minima of a given cost… (more)

Subjects/Keywords: Deterministic Annealing Algorithm; Computational Aspects

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Parekh, P. M. (2015). Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78688

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

Parekh, Pratik Mayur. “Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed December 15, 2019. http://hdl.handle.net/2142/78688.

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

MLA Handbook (7th Edition):

Parekh, Pratik Mayur. “Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects.” 2015. Web. 15 Dec 2019.

Vancouver:

Parekh PM. Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/2142/78688.

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

Council of Science Editors:

Parekh PM. Deterministic annealing algorithm: tutorial, application to pickup and delivery problem and computational aspects. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78688

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


University of Debrecen

3. Czomba, László. Mesterséges intelligencia alkalmazások .

Degree: DE – TEK – Informatikai Kar, 2011, University of Debrecen

A dolgozatban a mesterséges intelligencia kereső algoritmusairól írtam, és egy konkrét probléma megoldását készítettem el. Advisors/Committee Members: Nagy, Benedek (advisor).

Subjects/Keywords: mesterséges intelligencia; best first; heurisztika; wpf

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Czomba, L. (2011). Mesterséges intelligencia alkalmazások . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/101407

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

Czomba, László. “Mesterséges intelligencia alkalmazások .” 2011. Thesis, University of Debrecen. Accessed December 15, 2019. http://hdl.handle.net/2437/101407.

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

MLA Handbook (7th Edition):

Czomba, László. “Mesterséges intelligencia alkalmazások .” 2011. Web. 15 Dec 2019.

Vancouver:

Czomba L. Mesterséges intelligencia alkalmazások . [Internet] [Thesis]. University of Debrecen; 2011. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/2437/101407.

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

Council of Science Editors:

Czomba L. Mesterséges intelligencia alkalmazások . [Thesis]. University of Debrecen; 2011. Available from: http://hdl.handle.net/2437/101407

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


NSYSU

4. Huang, Zhi-Quan. Atomic structure and mechanical properties of of BC2N.

Degree: Master, Physics, 2010, NSYSU

 Structural motifs for the BC2N superlattices were identified from a systematic search based on a greedy algorithm. Using a tree data structure, we have retrieved… (more)

Subjects/Keywords: greedy algorithm; first principle; BC2N

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, Z. (2010). Atomic structure and mechanical properties of of BC2N. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402

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

Huang, Zhi-Quan. “Atomic structure and mechanical properties of of BC2N.” 2010. Thesis, NSYSU. Accessed December 15, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402.

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

MLA Handbook (7th Edition):

Huang, Zhi-Quan. “Atomic structure and mechanical properties of of BC2N.” 2010. Web. 15 Dec 2019.

Vancouver:

Huang Z. Atomic structure and mechanical properties of of BC2N. [Internet] [Thesis]. NSYSU; 2010. [cited 2019 Dec 15]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402.

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

Council of Science Editors:

Huang Z. Atomic structure and mechanical properties of of BC2N. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0706110-115402

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


University of Connecticut

5. Wang, Yuting. AMIBE: an Imperative Programming Language with First Class Continuations.

Degree: MS, Computer Science and Engineering, 2011, University of Connecticut

  A continuation represents the future of an execution. It is often used as an intermediate representation(IR) to compile functional programming languages, make control flow… (more)

Subjects/Keywords: AMIBE; Imperative Programming Language; Non-deterministic; First Class Continuation; CPS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, Y. (2011). AMIBE: an Imperative Programming Language with First Class Continuations. (Masters Thesis). University of Connecticut. Retrieved from https://opencommons.uconn.edu/gs_theses/142

Chicago Manual of Style (16th Edition):

Wang, Yuting. “AMIBE: an Imperative Programming Language with First Class Continuations.” 2011. Masters Thesis, University of Connecticut. Accessed December 15, 2019. https://opencommons.uconn.edu/gs_theses/142.

MLA Handbook (7th Edition):

Wang, Yuting. “AMIBE: an Imperative Programming Language with First Class Continuations.” 2011. Web. 15 Dec 2019.

Vancouver:

Wang Y. AMIBE: an Imperative Programming Language with First Class Continuations. [Internet] [Masters thesis]. University of Connecticut; 2011. [cited 2019 Dec 15]. Available from: https://opencommons.uconn.edu/gs_theses/142.

Council of Science Editors:

Wang Y. AMIBE: an Imperative Programming Language with First Class Continuations. [Masters Thesis]. University of Connecticut; 2011. Available from: https://opencommons.uconn.edu/gs_theses/142


Anna University

6. Krishnamurthy, K. Improvement of Performance measures In multi level assembly job shops Using particle swarm optimization And genetic algorithm; -.

Degree: Mechanical Engineering, 2014, Anna University

Assembly job shop scheduling problems that optimize lead newlineTime and tardiness are usually much more computationally complex and newlineare classified as strongly Non deterministic Polynomial… (more)

Subjects/Keywords: Genetic Algorithm; Non deterministic Polynomial; Particle Swarm Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krishnamurthy, K. (2014). Improvement of Performance measures In multi level assembly job shops Using particle swarm optimization And genetic algorithm; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27250

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

Krishnamurthy, K. “Improvement of Performance measures In multi level assembly job shops Using particle swarm optimization And genetic algorithm; -.” 2014. Thesis, Anna University. Accessed December 15, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/27250.

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

MLA Handbook (7th Edition):

Krishnamurthy, K. “Improvement of Performance measures In multi level assembly job shops Using particle swarm optimization And genetic algorithm; -.” 2014. Web. 15 Dec 2019.

Vancouver:

Krishnamurthy K. Improvement of Performance measures In multi level assembly job shops Using particle swarm optimization And genetic algorithm; -. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Dec 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27250.

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

Council of Science Editors:

Krishnamurthy K. Improvement of Performance measures In multi level assembly job shops Using particle swarm optimization And genetic algorithm; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27250

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


Texas A&M University

7. Watugala, Megha Weerakooon. The Sign-up Game, Sophisticated Learning and Learning Variable Demand.

Degree: 2009, Texas A&M University

 This dissertation makes contributions in topics related to mechanism design and learn-ing in game theoretic environments through three essays. The rst essay deals withthe question… (more)

Subjects/Keywords: principal-agent; first-best; learning; sophisticated learning; variable demand; learning demand

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Watugala, M. W. (2009). The Sign-up Game, Sophisticated Learning and Learning Variable Demand. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2933

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

Watugala, Megha Weerakooon. “The Sign-up Game, Sophisticated Learning and Learning Variable Demand.” 2009. Thesis, Texas A&M University. Accessed December 15, 2019. http://hdl.handle.net/1969.1/ETD-TAMU-2933.

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

MLA Handbook (7th Edition):

Watugala, Megha Weerakooon. “The Sign-up Game, Sophisticated Learning and Learning Variable Demand.” 2009. Web. 15 Dec 2019.

Vancouver:

Watugala MW. The Sign-up Game, Sophisticated Learning and Learning Variable Demand. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2933.

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

Council of Science Editors:

Watugala MW. The Sign-up Game, Sophisticated Learning and Learning Variable Demand. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2933

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


Anna University

8. Balaji N. Heuristic algorithms for the multi-period fixed charge models.

Degree: Mechanical Engineering, 2004, Anna University

The multi-period fixed charge problem is an extension of the multiperiod distribution problem and general fixed charge transportation problem, where the time based decisions on… (more)

Subjects/Keywords: Multiperiod distribution problem; Fixed charge transportation; Non-deterministic Polynomial-time; Simulated Annealing Algorithm; Genetic Algorithm; Equivalent Variable Cost

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

N, B. (2004). Heuristic algorithms for the multi-period fixed charge models. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/9880

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

N, Balaji. “Heuristic algorithms for the multi-period fixed charge models.” 2004. Thesis, Anna University. Accessed December 15, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/9880.

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

MLA Handbook (7th Edition):

N, Balaji. “Heuristic algorithms for the multi-period fixed charge models.” 2004. Web. 15 Dec 2019.

Vancouver:

N B. Heuristic algorithms for the multi-period fixed charge models. [Internet] [Thesis]. Anna University; 2004. [cited 2019 Dec 15]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9880.

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

Council of Science Editors:

N B. Heuristic algorithms for the multi-period fixed charge models. [Thesis]. Anna University; 2004. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/9880

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

9. Autere, Antti. Extensions and Applications of the A* Algorithm.

Degree: 2005, Helsinki University of Technology

In this thesis we investigate path finding problems, that is, planning routes from a start node to some goal nodes in a graph. Such problems… (more)

Subjects/Keywords: path finding; heuristic algorithms; best-first search; A*; resource allocation; robotics; motion planning; message routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Autere, A. (2005). Extensions and Applications of the A* Algorithm. (Thesis). Helsinki University of Technology. Retrieved from http://lib.tkk.fi/Diss/2005/isbn9512279487/

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

Autere, Antti. “Extensions and Applications of the A* Algorithm.” 2005. Thesis, Helsinki University of Technology. Accessed December 15, 2019. http://lib.tkk.fi/Diss/2005/isbn9512279487/.

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

MLA Handbook (7th Edition):

Autere, Antti. “Extensions and Applications of the A* Algorithm.” 2005. Web. 15 Dec 2019.

Vancouver:

Autere A. Extensions and Applications of the A* Algorithm. [Internet] [Thesis]. Helsinki University of Technology; 2005. [cited 2019 Dec 15]. Available from: http://lib.tkk.fi/Diss/2005/isbn9512279487/.

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

Council of Science Editors:

Autere A. Extensions and Applications of the A* Algorithm. [Thesis]. Helsinki University of Technology; 2005. Available from: http://lib.tkk.fi/Diss/2005/isbn9512279487/

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

10. Ait El Faqir, Marouane. Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain.

Degree: Docteur es, Automatique, 2016, Lyon

L'approche de la biologie des systèmes vise à intégrer les méthodologies appliquées dans la conception et l'analyse des systèmes technologiques complexes, au sein de la… (more)

Subjects/Keywords: Optimisation stochastique; Méthodes du Premier Ordre; Optimisation déterministe; Approximation Stochastique; RBA; Stochastic optimization; First Order Methods; Deterministic optimisation; Stochastic Approximation; RBA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ait El Faqir, M. (2016). Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2016LYSEC036

Chicago Manual of Style (16th Edition):

Ait El Faqir, Marouane. “Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain.” 2016. Doctoral Dissertation, Lyon. Accessed December 15, 2019. http://www.theses.fr/2016LYSEC036.

MLA Handbook (7th Edition):

Ait El Faqir, Marouane. “Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain.” 2016. Web. 15 Dec 2019.

Vancouver:

Ait El Faqir M. Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain. [Internet] [Doctoral dissertation]. Lyon; 2016. [cited 2019 Dec 15]. Available from: http://www.theses.fr/2016LYSEC036.

Council of Science Editors:

Ait El Faqir M. Prédiction de la structure de contrôle de bactéries par optimisation sous incertitude : Magnetic resonance elastography : contributions to acquisition and reconstruction of the shear modulus : association with quasi-static ultrasound elastography to study the effect of pre-strain. [Doctoral Dissertation]. Lyon; 2016. Available from: http://www.theses.fr/2016LYSEC036


University of Cincinnati

11. KRISHNAN, RAJESH. DEVELOPMENT OF A MODULAR SOFTWARE SYSTEM FOR MODELING AND ANALYZING BIOLOGICAL PATHWAYS.

Degree: PhD, Engineering : Electrical Engineering, 2007, University of Cincinnati

 Biological pathways provide a comprehensive view of a biological phenomenon, in the form of a network of inter-related reactions or processes. Modeling the biochemical reactions… (more)

Subjects/Keywords: Biological pathways; modeling; algorithm; phage lambda; bioluminescence; cancer pathway; TNF; stochastic model; deterministic model; optimization; bio-control database

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

KRISHNAN, R. (2007). DEVELOPMENT OF A MODULAR SOFTWARE SYSTEM FOR MODELING AND ANALYZING BIOLOGICAL PATHWAYS. (Doctoral Dissertation). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1181709492

Chicago Manual of Style (16th Edition):

KRISHNAN, RAJESH. “DEVELOPMENT OF A MODULAR SOFTWARE SYSTEM FOR MODELING AND ANALYZING BIOLOGICAL PATHWAYS.” 2007. Doctoral Dissertation, University of Cincinnati. Accessed December 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1181709492.

MLA Handbook (7th Edition):

KRISHNAN, RAJESH. “DEVELOPMENT OF A MODULAR SOFTWARE SYSTEM FOR MODELING AND ANALYZING BIOLOGICAL PATHWAYS.” 2007. Web. 15 Dec 2019.

Vancouver:

KRISHNAN R. DEVELOPMENT OF A MODULAR SOFTWARE SYSTEM FOR MODELING AND ANALYZING BIOLOGICAL PATHWAYS. [Internet] [Doctoral dissertation]. University of Cincinnati; 2007. [cited 2019 Dec 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1181709492.

Council of Science Editors:

KRISHNAN R. DEVELOPMENT OF A MODULAR SOFTWARE SYSTEM FOR MODELING AND ANALYZING BIOLOGICAL PATHWAYS. [Doctoral Dissertation]. University of Cincinnati; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1181709492


Uppsala University

12. Tan, Jun Liang. Development of a pitch based wake optimisation control strategy to improve total farm power production.

Degree: Earth Sciences, 2016, Uppsala University

  In this thesis, the effect of pitch based optimisation was explored for a 80 turbine wind farm. Using a modified Jensen wake model and… (more)

Subjects/Keywords: Wake reduction; Jensen Wake Model; Particle Swarm Optimisation; Wind turbine Control Algorithm; Deterministic Wake Modelling; Heuristic Optimisation model; Energy Systems; Energisystem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tan, J. L. (2016). Development of a pitch based wake optimisation control strategy to improve total farm power production. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-304705

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

Tan, Jun Liang. “Development of a pitch based wake optimisation control strategy to improve total farm power production.” 2016. Thesis, Uppsala University. Accessed December 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-304705.

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

MLA Handbook (7th Edition):

Tan, Jun Liang. “Development of a pitch based wake optimisation control strategy to improve total farm power production.” 2016. Web. 15 Dec 2019.

Vancouver:

Tan JL. Development of a pitch based wake optimisation control strategy to improve total farm power production. [Internet] [Thesis]. Uppsala University; 2016. [cited 2019 Dec 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-304705.

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

Council of Science Editors:

Tan JL. Development of a pitch based wake optimisation control strategy to improve total farm power production. [Thesis]. Uppsala University; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-304705

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


Delft University of Technology

13. De Bruin, J. Probabilistic record linkage with the Fellegi and Sunter framework: Using probabilistic record linkage to link privacy preserved police and hospital road accident records:.

Degree: 2015, Delft University of Technology

 Record linkage is the procedure of bringing together information from two or more records that are believed to belong to the same entity. The linking… (more)

Subjects/Keywords: record linkage; data matching; deduplication; fellegi and sunter; em-algorithm; statistics; probabilistic record linkage; deterministic record linkage; classification; indexing; databases

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

De Bruin, J. (2015). Probabilistic record linkage with the Fellegi and Sunter framework: Using probabilistic record linkage to link privacy preserved police and hospital road accident records:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:4ebdb50d-c02f-430b-8037-319b45a3e5db

Chicago Manual of Style (16th Edition):

De Bruin, J. “Probabilistic record linkage with the Fellegi and Sunter framework: Using probabilistic record linkage to link privacy preserved police and hospital road accident records:.” 2015. Masters Thesis, Delft University of Technology. Accessed December 15, 2019. http://resolver.tudelft.nl/uuid:4ebdb50d-c02f-430b-8037-319b45a3e5db.

MLA Handbook (7th Edition):

De Bruin, J. “Probabilistic record linkage with the Fellegi and Sunter framework: Using probabilistic record linkage to link privacy preserved police and hospital road accident records:.” 2015. Web. 15 Dec 2019.

Vancouver:

De Bruin J. Probabilistic record linkage with the Fellegi and Sunter framework: Using probabilistic record linkage to link privacy preserved police and hospital road accident records:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Dec 15]. Available from: http://resolver.tudelft.nl/uuid:4ebdb50d-c02f-430b-8037-319b45a3e5db.

Council of Science Editors:

De Bruin J. Probabilistic record linkage with the Fellegi and Sunter framework: Using probabilistic record linkage to link privacy preserved police and hospital road accident records:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:4ebdb50d-c02f-430b-8037-319b45a3e5db


Brigham Young University

14. Anderson, Robert Lawrence. An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena.

Degree: MS, 2005, Brigham Young University

I present a thorough examination of the unconditional deterministic polynomial-time algorithm for determining whether an input number is prime or composite proposed by Agrawal, Kayal and Saxena in their paper [1]. All proofs cited have been reworked with full details for the sake of completeness and readability.

Subjects/Keywords: prime; polynomial; deterministic; algorithm; composite; agrawal; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anderson, R. L. (2005). An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1530&context=etd

Chicago Manual of Style (16th Edition):

Anderson, Robert Lawrence. “An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena.” 2005. Masters Thesis, Brigham Young University. Accessed December 15, 2019. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1530&context=etd.

MLA Handbook (7th Edition):

Anderson, Robert Lawrence. “An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena.” 2005. Web. 15 Dec 2019.

Vancouver:

Anderson RL. An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena. [Internet] [Masters thesis]. Brigham Young University; 2005. [cited 2019 Dec 15]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1530&context=etd.

Council of Science Editors:

Anderson RL. An Exposition of the Deterministic Polynomial-Time Primality Testing Algorithm of Agrawal-Kayal-Saxena. [Masters Thesis]. Brigham Young University; 2005. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=1530&context=etd


Iowa State University

15. Lu, Ning. Theoretical studies of H-passivated silicon nanowires, silicon surface systems and Si/Ge core/shell nanowires.

Degree: 2010, Iowa State University

 Global structural optimization with Genetic Algorithm and first principle analysis have been performed on the Silicon nanowires, Ag induced Si surface reconstruction systems and Si/Ge… (more)

Subjects/Keywords: First Principle calculation; genetic algorithm; nanoelectronics; nanowires; semiconductor materials; surfaces; Physics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, N. (2010). Theoretical studies of H-passivated silicon nanowires, silicon surface systems and Si/Ge core/shell nanowires. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/11709

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

Lu, Ning. “Theoretical studies of H-passivated silicon nanowires, silicon surface systems and Si/Ge core/shell nanowires.” 2010. Thesis, Iowa State University. Accessed December 15, 2019. https://lib.dr.iastate.edu/etd/11709.

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

MLA Handbook (7th Edition):

Lu, Ning. “Theoretical studies of H-passivated silicon nanowires, silicon surface systems and Si/Ge core/shell nanowires.” 2010. Web. 15 Dec 2019.

Vancouver:

Lu N. Theoretical studies of H-passivated silicon nanowires, silicon surface systems and Si/Ge core/shell nanowires. [Internet] [Thesis]. Iowa State University; 2010. [cited 2019 Dec 15]. Available from: https://lib.dr.iastate.edu/etd/11709.

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

Council of Science Editors:

Lu N. Theoretical studies of H-passivated silicon nanowires, silicon surface systems and Si/Ge core/shell nanowires. [Thesis]. Iowa State University; 2010. Available from: https://lib.dr.iastate.edu/etd/11709

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


University of Minnesota

16. Wiley, Sarah. Algorithms, Machine Learning, and Speech: The Future of the First Amendment in a Digital World.

Degree: MA, Journalism, 2017, University of Minnesota

 We increasingly depend on algorithms to mediate information and thanks to the advance of computation power and big data, they do so more autonomously than… (more)

Subjects/Keywords: Algorithm; Communication; First Amendment; Google; Journalism; Machine Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wiley, S. (2017). Algorithms, Machine Learning, and Speech: The Future of the First Amendment in a Digital World. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/190586

Chicago Manual of Style (16th Edition):

Wiley, Sarah. “Algorithms, Machine Learning, and Speech: The Future of the First Amendment in a Digital World.” 2017. Masters Thesis, University of Minnesota. Accessed December 15, 2019. http://hdl.handle.net/11299/190586.

MLA Handbook (7th Edition):

Wiley, Sarah. “Algorithms, Machine Learning, and Speech: The Future of the First Amendment in a Digital World.” 2017. Web. 15 Dec 2019.

Vancouver:

Wiley S. Algorithms, Machine Learning, and Speech: The Future of the First Amendment in a Digital World. [Internet] [Masters thesis]. University of Minnesota; 2017. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/11299/190586.

Council of Science Editors:

Wiley S. Algorithms, Machine Learning, and Speech: The Future of the First Amendment in a Digital World. [Masters Thesis]. University of Minnesota; 2017. Available from: http://hdl.handle.net/11299/190586


Leiden University

17. Ciocanea Teodorescu I. Algorithms for finite rings.

Degree: 2016, Leiden University

 In this thesis we are interested in describing algorithms that answer questions arising in ring and module theory. Our focus is on deterministic polynomial-time algorithms… (more)

Subjects/Keywords: Deterministic polynomial time algorithm; Finite rings; Modules; Jacobson radical; Separability; Deterministic polynomial time algorithm; Finite rings; Modules; Jacobson radical; Separability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

I., C. T. (2016). Algorithms for finite rings. (Doctoral Dissertation). Leiden University. Retrieved from http://hdl.handle.net/1887/40676

Chicago Manual of Style (16th Edition):

I., Ciocanea Teodorescu. “Algorithms for finite rings.” 2016. Doctoral Dissertation, Leiden University. Accessed December 15, 2019. http://hdl.handle.net/1887/40676.

MLA Handbook (7th Edition):

I., Ciocanea Teodorescu. “Algorithms for finite rings.” 2016. Web. 15 Dec 2019.

Vancouver:

I. CT. Algorithms for finite rings. [Internet] [Doctoral dissertation]. Leiden University; 2016. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/1887/40676.

Council of Science Editors:

I. CT. Algorithms for finite rings. [Doctoral Dissertation]. Leiden University; 2016. Available from: http://hdl.handle.net/1887/40676


Virginia Tech

18. Siochi, Fernando C. Building a knowledge based simulation optimization system with discovery learning.

Degree: PhD, Management Science, 1995, Virginia Tech

Subjects/Keywords: expert systems; best-first search; LD5655.V856 1995.S563

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Siochi, F. C. (1995). Building a knowledge based simulation optimization system with discovery learning. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/38117

Chicago Manual of Style (16th Edition):

Siochi, Fernando C. “Building a knowledge based simulation optimization system with discovery learning.” 1995. Doctoral Dissertation, Virginia Tech. Accessed December 15, 2019. http://hdl.handle.net/10919/38117.

MLA Handbook (7th Edition):

Siochi, Fernando C. “Building a knowledge based simulation optimization system with discovery learning.” 1995. Web. 15 Dec 2019.

Vancouver:

Siochi FC. Building a knowledge based simulation optimization system with discovery learning. [Internet] [Doctoral dissertation]. Virginia Tech; 1995. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/10919/38117.

Council of Science Editors:

Siochi FC. Building a knowledge based simulation optimization system with discovery learning. [Doctoral Dissertation]. Virginia Tech; 1995. Available from: http://hdl.handle.net/10919/38117


IUPUI

19. Sherven, Keva N. WORLDS COLLIDE: INTEGRATING WRITING CENTER BEST PRACTICES INTO A FIRST YEAR COMPOSITION CLASSROOM.

Degree: 2010, IUPUI

Indiana University-Purdue University Indianapolis (IUPUI)

As an undergraduate, I had the opportunity to work in the University Writing Center (UWC) at IUPUI. This opportunity influenced… (more)

Subjects/Keywords: writing center best practices; composition; first year composition; FYC; writing center; Writing centers; Composition (Language arts)  – Study and teaching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sherven, K. N. (2010). WORLDS COLLIDE: INTEGRATING WRITING CENTER BEST PRACTICES INTO A FIRST YEAR COMPOSITION CLASSROOM. (Thesis). IUPUI. Retrieved from http://hdl.handle.net/1805/2232

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

Sherven, Keva N. “WORLDS COLLIDE: INTEGRATING WRITING CENTER BEST PRACTICES INTO A FIRST YEAR COMPOSITION CLASSROOM.” 2010. Thesis, IUPUI. Accessed December 15, 2019. http://hdl.handle.net/1805/2232.

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

MLA Handbook (7th Edition):

Sherven, Keva N. “WORLDS COLLIDE: INTEGRATING WRITING CENTER BEST PRACTICES INTO A FIRST YEAR COMPOSITION CLASSROOM.” 2010. Web. 15 Dec 2019.

Vancouver:

Sherven KN. WORLDS COLLIDE: INTEGRATING WRITING CENTER BEST PRACTICES INTO A FIRST YEAR COMPOSITION CLASSROOM. [Internet] [Thesis]. IUPUI; 2010. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/1805/2232.

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

Council of Science Editors:

Sherven KN. WORLDS COLLIDE: INTEGRATING WRITING CENTER BEST PRACTICES INTO A FIRST YEAR COMPOSITION CLASSROOM. [Thesis]. IUPUI; 2010. Available from: http://hdl.handle.net/1805/2232

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


Universidad Nacional de La Plata

20. Sanz, Victoria María. Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search sobre multicore y cluster de multicore.

Degree: 2015, Universidad Nacional de La Plata

El objetivo general de esta tesis se centra en la investigación y desarrollo de algoritmos paralelos de búsqueda en grafos best-first search para arquitecturas multicore… (more)

Subjects/Keywords: Ciencias Informáticas; Best-First Search; algoritmos paralelos; análisis de rendimiento; multicore; cluster de multicore; Algorithms; Parallel algorithms; Clustering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sanz, V. M. (2015). Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search sobre multicore y cluster de multicore. (Thesis). Universidad Nacional de La Plata. Retrieved from http://hdl.handle.net/10915/44478

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

Sanz, Victoria María. “Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search sobre multicore y cluster de multicore.” 2015. Thesis, Universidad Nacional de La Plata. Accessed December 15, 2019. http://hdl.handle.net/10915/44478.

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

MLA Handbook (7th Edition):

Sanz, Victoria María. “Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search sobre multicore y cluster de multicore.” 2015. Web. 15 Dec 2019.

Vancouver:

Sanz VM. Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search sobre multicore y cluster de multicore. [Internet] [Thesis]. Universidad Nacional de La Plata; 2015. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/10915/44478.

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

Council of Science Editors:

Sanz VM. Análisis de rendimiento y optimización de algoritmos paralelos Best-First Search sobre multicore y cluster de multicore. [Thesis]. Universidad Nacional de La Plata; 2015. Available from: http://hdl.handle.net/10915/44478

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


Linnaeus University

21. Bermúdez, Yoel Sánchez. How to select the right machine learning approach?.

Degree: Computer Science, 2013, Linnaeus University

  In the last years, the use of machine learning methods has increased remarkably and therefore the research in this field is becoming more and… (more)

Subjects/Keywords: machine learning; application; algorithm; machine learning approach; best learner; classification; statistical measures; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bermúdez, Y. S. (2013). How to select the right machine learning approach?. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-28594

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

Bermúdez, Yoel Sánchez. “How to select the right machine learning approach?.” 2013. Thesis, Linnaeus University. Accessed December 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-28594.

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

MLA Handbook (7th Edition):

Bermúdez, Yoel Sánchez. “How to select the right machine learning approach?.” 2013. Web. 15 Dec 2019.

Vancouver:

Bermúdez YS. How to select the right machine learning approach?. [Internet] [Thesis]. Linnaeus University; 2013. [cited 2019 Dec 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-28594.

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

Council of Science Editors:

Bermúdez YS. How to select the right machine learning approach?. [Thesis]. Linnaeus University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-28594

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


University of KwaZulu-Natal

22. Chetty, Mervin. The enhanced best performance algorithm for global optimization with applications.

Degree: 2016, University of KwaZulu-Natal

Abstract available in PDF file. Advisors/Committee Members: Adewumi, Aderemi Oluyinka. (advisor).

Subjects/Keywords: Best performance algorithm.; Algorithms.; Stochastic metaheuristics.; Mathematical optimization.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chetty, M. (2016). The enhanced best performance algorithm for global optimization with applications. (Thesis). University of KwaZulu-Natal. Retrieved from https://researchspace.ukzn.ac.za/handle/10413/16332

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

Chetty, Mervin. “The enhanced best performance algorithm for global optimization with applications.” 2016. Thesis, University of KwaZulu-Natal. Accessed December 15, 2019. https://researchspace.ukzn.ac.za/handle/10413/16332.

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

MLA Handbook (7th Edition):

Chetty, Mervin. “The enhanced best performance algorithm for global optimization with applications.” 2016. Web. 15 Dec 2019.

Vancouver:

Chetty M. The enhanced best performance algorithm for global optimization with applications. [Internet] [Thesis]. University of KwaZulu-Natal; 2016. [cited 2019 Dec 15]. Available from: https://researchspace.ukzn.ac.za/handle/10413/16332.

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

Council of Science Editors:

Chetty M. The enhanced best performance algorithm for global optimization with applications. [Thesis]. University of KwaZulu-Natal; 2016. Available from: https://researchspace.ukzn.ac.za/handle/10413/16332

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


University of Johannesburg

23. Booth, James Frank. An investigation into finite resource allocation methods.

Degree: 2012, University of Johannesburg

M. Ing.

The report presents and analyses allocation methods for assigning limited resources to project tasks. The report is partitioned into five chapters beginning with… (more)

Subjects/Keywords: Finite resource allocation methods; Least Slack allocation method; Best Fit allocation method; Project resource allocation; Hu’s Algorithm; Coffman’s and Munt’s Algorithm; Resource allocation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Booth, J. F. (2012). An investigation into finite resource allocation methods. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/4843

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

Booth, James Frank. “An investigation into finite resource allocation methods.” 2012. Thesis, University of Johannesburg. Accessed December 15, 2019. http://hdl.handle.net/10210/4843.

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

MLA Handbook (7th Edition):

Booth, James Frank. “An investigation into finite resource allocation methods.” 2012. Web. 15 Dec 2019.

Vancouver:

Booth JF. An investigation into finite resource allocation methods. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/10210/4843.

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

Council of Science Editors:

Booth JF. An investigation into finite resource allocation methods. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/4843

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


NSYSU

24. Hsu, Yao-chung. Minimally Supported D-optimal Designs for Response Surface Models with Spatially Correlated Errors.

Degree: Master, Applied Mathematics, 2012, NSYSU

 In this work minimally supported D-optimal designs for response surface models with spatially correlated errors are studied. The spatially correlated errors describe the correlation between… (more)

Subjects/Keywords: first-order response surface model; simulated annealing algorithm; covariance function; polynomial models; D-optimality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hsu, Y. (2012). Minimally Supported D-optimal Designs for Response Surface Models with Spatially Correlated Errors. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705112-123036

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

Hsu, Yao-chung. “Minimally Supported D-optimal Designs for Response Surface Models with Spatially Correlated Errors.” 2012. Thesis, NSYSU. Accessed December 15, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705112-123036.

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

MLA Handbook (7th Edition):

Hsu, Yao-chung. “Minimally Supported D-optimal Designs for Response Surface Models with Spatially Correlated Errors.” 2012. Web. 15 Dec 2019.

Vancouver:

Hsu Y. Minimally Supported D-optimal Designs for Response Surface Models with Spatially Correlated Errors. [Internet] [Thesis]. NSYSU; 2012. [cited 2019 Dec 15]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705112-123036.

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

Council of Science Editors:

Hsu Y. Minimally Supported D-optimal Designs for Response Surface Models with Spatially Correlated Errors. [Thesis]. NSYSU; 2012. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0705112-123036

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

25. Demchuk, Kostiantyn. A Fast Minimal Infrequent Itemset Mining Algorithm.

Degree: 2014, RIAN

A novel fast algorithm for finding quasi identifiers in large datasets is presented. Performance measurements on a broad range of datasets demonstrate substantial reductions in run-time relative to the state of the art and the scalability of the algorithm to realistically-sized datasets up to several million records.

Subjects/Keywords: Hamilton Institute; itemset mining; breadth-first algorithm; frequency-based analysis; k-anonymity; performance; load balancing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Demchuk, K. (2014). A Fast Minimal Infrequent Itemset Mining Algorithm. (Thesis). RIAN. Retrieved from http://eprints.maynoothuniversity.ie/6325/

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

Demchuk, Kostiantyn. “A Fast Minimal Infrequent Itemset Mining Algorithm.” 2014. Thesis, RIAN. Accessed December 15, 2019. http://eprints.maynoothuniversity.ie/6325/.

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

MLA Handbook (7th Edition):

Demchuk, Kostiantyn. “A Fast Minimal Infrequent Itemset Mining Algorithm.” 2014. Web. 15 Dec 2019.

Vancouver:

Demchuk K. A Fast Minimal Infrequent Itemset Mining Algorithm. [Internet] [Thesis]. RIAN; 2014. [cited 2019 Dec 15]. Available from: http://eprints.maynoothuniversity.ie/6325/.

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

Council of Science Editors:

Demchuk K. A Fast Minimal Infrequent Itemset Mining Algorithm. [Thesis]. RIAN; 2014. Available from: http://eprints.maynoothuniversity.ie/6325/

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

26. Vuong, J.M. Solving the multi-objective Dial-a-Ride problem without using routing heuristics:.

Degree: 2011, Delft University of Technology

 Door-to-door transportation services are very important for disabled or elderly people, as they have difficulties using regular public transport services. These services work on a… (more)

Subjects/Keywords: dial-a-ride problem; DARP; DARPTW; genetic algorithm; cluster-first-route-second

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

Vuong, J. M. (2011). Solving the multi-objective Dial-a-Ride problem without using routing heuristics:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:c148088d-5332-42cf-8d4c-f28d8284bf2d

Chicago Manual of Style (16th Edition):

Vuong, J M. “Solving the multi-objective Dial-a-Ride problem without using routing heuristics:.” 2011. Masters Thesis, Delft University of Technology. Accessed December 15, 2019. http://resolver.tudelft.nl/uuid:c148088d-5332-42cf-8d4c-f28d8284bf2d.

MLA Handbook (7th Edition):

Vuong, J M. “Solving the multi-objective Dial-a-Ride problem without using routing heuristics:.” 2011. Web. 15 Dec 2019.

Vancouver:

Vuong JM. Solving the multi-objective Dial-a-Ride problem without using routing heuristics:. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2019 Dec 15]. Available from: http://resolver.tudelft.nl/uuid:c148088d-5332-42cf-8d4c-f28d8284bf2d.

Council of Science Editors:

Vuong JM. Solving the multi-objective Dial-a-Ride problem without using routing heuristics:. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:c148088d-5332-42cf-8d4c-f28d8284bf2d

27. Touray, Barra. Energy-efficient routing algorithms for wireless sensor networks.

Degree: PhD, 2013, Liverpool John Moores University

 A wireless sensor network (WSN) is made of tiny sensor nodes usually deployed in high density within a targeted area to monitor a phenomenon of… (more)

Subjects/Keywords: 621.382; biased random walk, routing algorithm, clustering, energy efficient, shortest path first, wireless sensor network.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Touray, B. (2013). Energy-efficient routing algorithms for wireless sensor networks. (Doctoral Dissertation). Liverpool John Moores University. Retrieved from http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282

Chicago Manual of Style (16th Edition):

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Doctoral Dissertation, Liverpool John Moores University. Accessed December 15, 2019. http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

MLA Handbook (7th Edition):

Touray, Barra. “Energy-efficient routing algorithms for wireless sensor networks.” 2013. Web. 15 Dec 2019.

Vancouver:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Internet] [Doctoral dissertation]. Liverpool John Moores University; 2013. [cited 2019 Dec 15]. Available from: http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282.

Council of Science Editors:

Touray B. Energy-efficient routing algorithms for wireless sensor networks. [Doctoral Dissertation]. Liverpool John Moores University; 2013. Available from: http://researchonline.ljmu.ac.uk/id/eprint/4352/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.594282


The Ohio State University

28. Liu, Zhixin. Capacity allocation and rescheduling in supply chains.

Degree: PhD, Business Administration, 2007, The Ohio State University

First, we study the problem of rescheduling for multiple new orders. Assume that a set of original jobs has been scheduled on a single machine,… (more)

Subjects/Keywords: Business Administration, Management; deterministic scheduling; rescheduling for new job disruptions; heuristic worstcase analysis; branch and bound algorithm; supply chain; capacity allocation; cooperative game; value of coordination; noncooperative game; auction mechanism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, Z. (2007). Capacity allocation and rescheduling in supply chains. (Doctoral Dissertation). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767

Chicago Manual of Style (16th Edition):

Liu, Zhixin. “Capacity allocation and rescheduling in supply chains.” 2007. Doctoral Dissertation, The Ohio State University. Accessed December 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767.

MLA Handbook (7th Edition):

Liu, Zhixin. “Capacity allocation and rescheduling in supply chains.” 2007. Web. 15 Dec 2019.

Vancouver:

Liu Z. Capacity allocation and rescheduling in supply chains. [Internet] [Doctoral dissertation]. The Ohio State University; 2007. [cited 2019 Dec 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767.

Council of Science Editors:

Liu Z. Capacity allocation and rescheduling in supply chains. [Doctoral Dissertation]. The Ohio State University; 2007. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767


University of Exeter

29. Basupi, Innocent. Adaptive water distribution system design under future uncertainty.

Degree: PhD, 2013, University of Exeter

 A water distribution system (WDS) design deals with achieving the desired network performance. WDS design can involve new and / or existing network redesigns in… (more)

Subjects/Keywords: 363.6; Design of Water Distribution Systems; Future Uncertainty; Deterministic Designs; Life Cycle Energy Consumption; Greenhouse Gas Emissions; Water Demand Management; Flexible Designs; Genetic Algorithm Optimisation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Basupi, I. (2013). Adaptive water distribution system design under future uncertainty. (Doctoral Dissertation). University of Exeter. Retrieved from http://hdl.handle.net/10871/14722

Chicago Manual of Style (16th Edition):

Basupi, Innocent. “Adaptive water distribution system design under future uncertainty.” 2013. Doctoral Dissertation, University of Exeter. Accessed December 15, 2019. http://hdl.handle.net/10871/14722.

MLA Handbook (7th Edition):

Basupi, Innocent. “Adaptive water distribution system design under future uncertainty.” 2013. Web. 15 Dec 2019.

Vancouver:

Basupi I. Adaptive water distribution system design under future uncertainty. [Internet] [Doctoral dissertation]. University of Exeter; 2013. [cited 2019 Dec 15]. Available from: http://hdl.handle.net/10871/14722.

Council of Science Editors:

Basupi I. Adaptive water distribution system design under future uncertainty. [Doctoral Dissertation]. University of Exeter; 2013. Available from: http://hdl.handle.net/10871/14722

30. XIAO SHENG. FLEXIBLE QUANTITATIVE SIMULATION IN CELL CYCLE CONTROL, ALGORITHMS AND IMPLEMENTATION.

Degree: 2003, National University of Singapore

Subjects/Keywords: Cell Cycle; In-silico experiment; Algorithm; Budding yeast; Deterministic model; Stochastic simulation; C++

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

SHENG, X. (2003). FLEXIBLE QUANTITATIVE SIMULATION IN CELL CYCLE CONTROL, ALGORITHMS AND IMPLEMENTATION. (Thesis). National University of Singapore. Retrieved from https://scholarbank.nus.edu.sg/handle/10635/153890

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

SHENG, XIAO. “FLEXIBLE QUANTITATIVE SIMULATION IN CELL CYCLE CONTROL, ALGORITHMS AND IMPLEMENTATION.” 2003. Thesis, National University of Singapore. Accessed December 15, 2019. https://scholarbank.nus.edu.sg/handle/10635/153890.

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

MLA Handbook (7th Edition):

SHENG, XIAO. “FLEXIBLE QUANTITATIVE SIMULATION IN CELL CYCLE CONTROL, ALGORITHMS AND IMPLEMENTATION.” 2003. Web. 15 Dec 2019.

Vancouver:

SHENG X. FLEXIBLE QUANTITATIVE SIMULATION IN CELL CYCLE CONTROL, ALGORITHMS AND IMPLEMENTATION. [Internet] [Thesis]. National University of Singapore; 2003. [cited 2019 Dec 15]. Available from: https://scholarbank.nus.edu.sg/handle/10635/153890.

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

Council of Science Editors:

SHENG X. FLEXIBLE QUANTITATIVE SIMULATION IN CELL CYCLE CONTROL, ALGORITHMS AND IMPLEMENTATION. [Thesis]. National University of Singapore; 2003. Available from: https://scholarbank.nus.edu.sg/handle/10635/153890

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

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

.