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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Wake Forest University

1. Taylor, Tyiste Braché. Judgment Day: Big Data as the Big Decider.

Degree: 2018, Wake Forest University

 This Digital Age has borne witness to not only an influx of information but also the need to make use of this information. The rapid… (more)

Subjects/Keywords: algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Taylor, T. B. (2018). Judgment Day: Big Data as the Big Decider. (Thesis). Wake Forest University. Retrieved from http://hdl.handle.net/10339/90746

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

Taylor, Tyiste Braché. “Judgment Day: Big Data as the Big Decider.” 2018. Thesis, Wake Forest University. Accessed October 22, 2019. http://hdl.handle.net/10339/90746.

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

MLA Handbook (7th Edition):

Taylor, Tyiste Braché. “Judgment Day: Big Data as the Big Decider.” 2018. Web. 22 Oct 2019.

Vancouver:

Taylor TB. Judgment Day: Big Data as the Big Decider. [Internet] [Thesis]. Wake Forest University; 2018. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10339/90746.

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

Council of Science Editors:

Taylor TB. Judgment Day: Big Data as the Big Decider. [Thesis]. Wake Forest University; 2018. Available from: http://hdl.handle.net/10339/90746

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


Anna University

2. Vimal kumar D. Different approaches for miningassociation rules from Multi relational databases;.

Degree: Different approaches for miningassociation rules from Multi relational databases, 2015, Anna University

Defining a multi relational pattern that is suitably meaningful and discovering vital information through efficient mining algorithm is a challenging problem and significant works have… (more)

Subjects/Keywords: Genetic algorithm; Mining algorithm; Optimization algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

D, V. k. (2015). Different approaches for miningassociation rules from Multi relational databases;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/34202

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

D, Vimal kumar. “Different approaches for miningassociation rules from Multi relational databases;.” 2015. Thesis, Anna University. Accessed October 22, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/34202.

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

MLA Handbook (7th Edition):

D, Vimal kumar. “Different approaches for miningassociation rules from Multi relational databases;.” 2015. Web. 22 Oct 2019.

Vancouver:

D Vk. Different approaches for miningassociation rules from Multi relational databases;. [Internet] [Thesis]. Anna University; 2015. [cited 2019 Oct 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34202.

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

Council of Science Editors:

D Vk. Different approaches for miningassociation rules from Multi relational databases;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/34202

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


University of Georgia

3. Johnson, Bernadette Elaine. Using the Levenshtein algorithm for automatic lemmatization in Old English.

Degree: MA, English, 2009, University of Georgia

 This study was undertaken to develop and test an automatic lemmatization program for the Old English language utilizing the Levenshtein edit distance algorithm, stemming, and… (more)

Subjects/Keywords: Levenshtein Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johnson, B. E. (2009). Using the Levenshtein algorithm for automatic lemmatization in Old English. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma

Chicago Manual of Style (16th Edition):

Johnson, Bernadette Elaine. “Using the Levenshtein algorithm for automatic lemmatization in Old English.” 2009. Masters Thesis, University of Georgia. Accessed October 22, 2019. http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma.

MLA Handbook (7th Edition):

Johnson, Bernadette Elaine. “Using the Levenshtein algorithm for automatic lemmatization in Old English.” 2009. Web. 22 Oct 2019.

Vancouver:

Johnson BE. Using the Levenshtein algorithm for automatic lemmatization in Old English. [Internet] [Masters thesis]. University of Georgia; 2009. [cited 2019 Oct 22]. Available from: http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma.

Council of Science Editors:

Johnson BE. Using the Levenshtein algorithm for automatic lemmatization in Old English. [Masters Thesis]. University of Georgia; 2009. Available from: http://purl.galileo.usg.edu/uga_etd/johnson_bernadette_e_200905_ma


University of Georgia

4. Xing, Guangming. Generating NFA for efficient pattern matching.

Degree: PhD, Computer Science, 2001, University of Georgia

 Research in regular languages and their associated computational problems has been revitalized by the rapid development of the Internet and its applications. The construction of… (more)

Subjects/Keywords: Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xing, G. (2001). Generating NFA for efficient pattern matching. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd

Chicago Manual of Style (16th Edition):

Xing, Guangming. “Generating NFA for efficient pattern matching.” 2001. Doctoral Dissertation, University of Georgia. Accessed October 22, 2019. http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd.

MLA Handbook (7th Edition):

Xing, Guangming. “Generating NFA for efficient pattern matching.” 2001. Web. 22 Oct 2019.

Vancouver:

Xing G. Generating NFA for efficient pattern matching. [Internet] [Doctoral dissertation]. University of Georgia; 2001. [cited 2019 Oct 22]. Available from: http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd.

Council of Science Editors:

Xing G. Generating NFA for efficient pattern matching. [Doctoral Dissertation]. University of Georgia; 2001. Available from: http://purl.galileo.usg.edu/uga_etd/xing_guangming_200112_phd


University of Georgia

5. Zhong, Weiwei. Using traveling salesman problem algorithms to determine multiple sequence alignment orders.

Degree: MS, Computer Science, 2003, University of Georgia

 Multiple Sequence Alignment (MSA) is one of the most important tools in modern biology. The MSA problem is NP-hard, therefore, heuristic approaches are needed to… (more)

Subjects/Keywords: algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhong, W. (2003). Using traveling salesman problem algorithms to determine multiple sequence alignment orders. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms

Chicago Manual of Style (16th Edition):

Zhong, Weiwei. “Using traveling salesman problem algorithms to determine multiple sequence alignment orders.” 2003. Masters Thesis, University of Georgia. Accessed October 22, 2019. http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms.

MLA Handbook (7th Edition):

Zhong, Weiwei. “Using traveling salesman problem algorithms to determine multiple sequence alignment orders.” 2003. Web. 22 Oct 2019.

Vancouver:

Zhong W. Using traveling salesman problem algorithms to determine multiple sequence alignment orders. [Internet] [Masters thesis]. University of Georgia; 2003. [cited 2019 Oct 22]. Available from: http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms.

Council of Science Editors:

Zhong W. Using traveling salesman problem algorithms to determine multiple sequence alignment orders. [Masters Thesis]. University of Georgia; 2003. Available from: http://purl.galileo.usg.edu/uga_etd/zhong_weiwei_200305_ms


University of Georgia

6. Ujjwal, Kumar. Cyber haggler: web based bargaining using genetic algorithm.

Degree: MS, Artificial Intelligence, 2007, University of Georgia

 In this thesis, we analyze the sequential bargaining problem from a different perspective. Instead of taking a game theoretic approach, we model bargaining as a… (more)

Subjects/Keywords: Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ujjwal, K. (2007). Cyber haggler: web based bargaining using genetic algorithm. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms

Chicago Manual of Style (16th Edition):

Ujjwal, Kumar. “Cyber haggler: web based bargaining using genetic algorithm.” 2007. Masters Thesis, University of Georgia. Accessed October 22, 2019. http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms.

MLA Handbook (7th Edition):

Ujjwal, Kumar. “Cyber haggler: web based bargaining using genetic algorithm.” 2007. Web. 22 Oct 2019.

Vancouver:

Ujjwal K. Cyber haggler: web based bargaining using genetic algorithm. [Internet] [Masters thesis]. University of Georgia; 2007. [cited 2019 Oct 22]. Available from: http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms.

Council of Science Editors:

Ujjwal K. Cyber haggler: web based bargaining using genetic algorithm. [Masters Thesis]. University of Georgia; 2007. Available from: http://purl.galileo.usg.edu/uga_etd/ujjwal_kumar_200705_ms


University of Windsor

7. He, Xinyu. Heuristics for Multi-Population Cultural Algorithm.

Degree: MS, Computer Science, 2015, University of Windsor

 Cultural Algorithm (CA) is one of the Evolutionary Algorithms (EAs) which de- rives from the cultural evolution process in nature. As an extended version of… (more)

Subjects/Keywords: Cultural Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

He, X. (2015). Heuristics for Multi-Population Cultural Algorithm. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5639

Chicago Manual of Style (16th Edition):

He, Xinyu. “Heuristics for Multi-Population Cultural Algorithm.” 2015. Masters Thesis, University of Windsor. Accessed October 22, 2019. https://scholar.uwindsor.ca/etd/5639.

MLA Handbook (7th Edition):

He, Xinyu. “Heuristics for Multi-Population Cultural Algorithm.” 2015. Web. 22 Oct 2019.

Vancouver:

He X. Heuristics for Multi-Population Cultural Algorithm. [Internet] [Masters thesis]. University of Windsor; 2015. [cited 2019 Oct 22]. Available from: https://scholar.uwindsor.ca/etd/5639.

Council of Science Editors:

He X. Heuristics for Multi-Population Cultural Algorithm. [Masters Thesis]. University of Windsor; 2015. Available from: https://scholar.uwindsor.ca/etd/5639

8. Malitsky, Yuri. Instance-Specific Algorithm Configuration.

Degree: PhD, Computer Science, 2012, Brown University

 When developing a new heuristic or complete algorithm for a constraint satisfaction or constrained optimization problem, we frequently face the problem of choice. There may… (more)

Subjects/Keywords: algorithm configuration

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malitsky, Y. (2012). Instance-Specific Algorithm Configuration. (Doctoral Dissertation). Brown University. Retrieved from https://repository.library.brown.edu/studio/item/bdr:297609/

Chicago Manual of Style (16th Edition):

Malitsky, Yuri. “Instance-Specific Algorithm Configuration.” 2012. Doctoral Dissertation, Brown University. Accessed October 22, 2019. https://repository.library.brown.edu/studio/item/bdr:297609/.

MLA Handbook (7th Edition):

Malitsky, Yuri. “Instance-Specific Algorithm Configuration.” 2012. Web. 22 Oct 2019.

Vancouver:

Malitsky Y. Instance-Specific Algorithm Configuration. [Internet] [Doctoral dissertation]. Brown University; 2012. [cited 2019 Oct 22]. Available from: https://repository.library.brown.edu/studio/item/bdr:297609/.

Council of Science Editors:

Malitsky Y. Instance-Specific Algorithm Configuration. [Doctoral Dissertation]. Brown University; 2012. Available from: https://repository.library.brown.edu/studio/item/bdr:297609/


NSYSU

9. Liao, Yu-Hsun. A Quantum-inspired Evolutionary Clustering Algorithm.

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

 In recent years, a lot of evolutionary computation methods have been proposed to solve the combinatorial optimization problem based on the concepts of quantum mechanics.… (more)

Subjects/Keywords: clustering; quantum-inspired evolutionary algorithm; Evolutionary algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liao, Y. (2014). A Quantum-inspired Evolutionary Clustering Algorithm. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921

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

Chicago Manual of Style (16th Edition):

Liao, Yu-Hsun. “A Quantum-inspired Evolutionary Clustering Algorithm.” 2014. Thesis, NSYSU. Accessed October 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921.

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

MLA Handbook (7th Edition):

Liao, Yu-Hsun. “A Quantum-inspired Evolutionary Clustering Algorithm.” 2014. Web. 22 Oct 2019.

Vancouver:

Liao Y. A Quantum-inspired Evolutionary Clustering Algorithm. [Internet] [Thesis]. NSYSU; 2014. [cited 2019 Oct 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921.

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

Council of Science Editors:

Liao Y. A Quantum-inspired Evolutionary Clustering Algorithm. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0317114-105921

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


Cornell University

10. Qian, Jiawei. Prize-Collecting Network Design .

Degree: 2012, Cornell University

 Network design is an active research area in discrete optimization that focuses on problems arising from the construction of communication networks. The prize-collecting version of… (more)

Subjects/Keywords: Network design; Approximation algorithm; Online algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qian, J. (2012). Prize-Collecting Network Design . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/29363

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

Qian, Jiawei. “Prize-Collecting Network Design .” 2012. Thesis, Cornell University. Accessed October 22, 2019. http://hdl.handle.net/1813/29363.

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

MLA Handbook (7th Edition):

Qian, Jiawei. “Prize-Collecting Network Design .” 2012. Web. 22 Oct 2019.

Vancouver:

Qian J. Prize-Collecting Network Design . [Internet] [Thesis]. Cornell University; 2012. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/1813/29363.

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

Council of Science Editors:

Qian J. Prize-Collecting Network Design . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/29363

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

11. Wegrzyn, Dominik. Creating 3D object descriptors using a genetic algorithm.

Degree: 2013, RCAAP

 In the technological world that we live in, the need for computer vision became almost as important as human vision. We are surrounded be all… (more)

Subjects/Keywords: Genetic algorithm; Genetic algorithm - Object 3D

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wegrzyn, D. (2013). Creating 3D object descriptors using a genetic algorithm. (Thesis). RCAAP. Retrieved from https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694

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

Wegrzyn, Dominik. “Creating 3D object descriptors using a genetic algorithm.” 2013. Thesis, RCAAP. Accessed October 22, 2019. https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694.

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

MLA Handbook (7th Edition):

Wegrzyn, Dominik. “Creating 3D object descriptors using a genetic algorithm.” 2013. Web. 22 Oct 2019.

Vancouver:

Wegrzyn D. Creating 3D object descriptors using a genetic algorithm. [Internet] [Thesis]. RCAAP; 2013. [cited 2019 Oct 22]. Available from: https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694.

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

Council of Science Editors:

Wegrzyn D. Creating 3D object descriptors using a genetic algorithm. [Thesis]. RCAAP; 2013. Available from: https://www.rcaap.pt/detail.jsp?id=oai:ubibliorum.ubi.pt:10400.6/3694

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

12. Johansson, Niklas. Efficient Simulation of the Deutsch-Jozsa Algorithm.

Degree: Faculty of Science & Engineering, 2015, Linköping UniversityLinköping University

  We provide a framework wherein one can simulate the Deutsch-Jozsa quantum algorithm on a regular computer within polynomial time, and with linear memory consumption.… (more)

Subjects/Keywords: Quantum algorithm; The Deutsch-Jozsa algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Johansson, N. (2015). Efficient Simulation of the Deutsch-Jozsa Algorithm. (Thesis). Linköping UniversityLinköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-120110

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

Johansson, Niklas. “Efficient Simulation of the Deutsch-Jozsa Algorithm.” 2015. Thesis, Linköping UniversityLinköping University. Accessed October 22, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-120110.

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

MLA Handbook (7th Edition):

Johansson, Niklas. “Efficient Simulation of the Deutsch-Jozsa Algorithm.” 2015. Web. 22 Oct 2019.

Vancouver:

Johansson N. Efficient Simulation of the Deutsch-Jozsa Algorithm. [Internet] [Thesis]. Linköping UniversityLinköping University; 2015. [cited 2019 Oct 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-120110.

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

Council of Science Editors:

Johansson N. Efficient Simulation of the Deutsch-Jozsa Algorithm. [Thesis]. Linköping UniversityLinköping University; 2015. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-120110

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


University of Waterloo

13. Liu, Guoxiang. Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models.

Degree: 2010, University of Waterloo

 The shallow subsurface controls the partitioning of available energy between sensible and latent heat of the land surface, and the partitioning of available water among… (more)

Subjects/Keywords: infiltration algorithm; interflow algorithm; distributed hydrological models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Liu, G. (2010). Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5519

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

Liu, Guoxiang. “Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models.” 2010. Thesis, University of Waterloo. Accessed October 22, 2019. http://hdl.handle.net/10012/5519.

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

MLA Handbook (7th Edition):

Liu, Guoxiang. “Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models.” 2010. Web. 22 Oct 2019.

Vancouver:

Liu G. Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10012/5519.

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

Council of Science Editors:

Liu G. Improved Interflow and Infiltration Algorithms for Distributed Hydrological Models. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5519

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


University of Windsor

14. Hlynka, Andrew William. Using Heritage in Multi-Population Evolutionary Algorithms.

Degree: MS, Computer Science, 2015, University of Windsor

 Multi-Population Cultural Algorithms (MPCA) define a set of individuals that can be categorized as belonging to one of a set of populations. Not only reserved… (more)

Subjects/Keywords: cultural algorithm; evolutionary algorithm; heritage; multi-population

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hlynka, A. W. (2015). Using Heritage in Multi-Population Evolutionary Algorithms. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5641

Chicago Manual of Style (16th Edition):

Hlynka, Andrew William. “Using Heritage in Multi-Population Evolutionary Algorithms.” 2015. Masters Thesis, University of Windsor. Accessed October 22, 2019. https://scholar.uwindsor.ca/etd/5641.

MLA Handbook (7th Edition):

Hlynka, Andrew William. “Using Heritage in Multi-Population Evolutionary Algorithms.” 2015. Web. 22 Oct 2019.

Vancouver:

Hlynka AW. Using Heritage in Multi-Population Evolutionary Algorithms. [Internet] [Masters thesis]. University of Windsor; 2015. [cited 2019 Oct 22]. Available from: https://scholar.uwindsor.ca/etd/5641.

Council of Science Editors:

Hlynka AW. Using Heritage in Multi-Population Evolutionary Algorithms. [Masters Thesis]. University of Windsor; 2015. Available from: https://scholar.uwindsor.ca/etd/5641


University of Limerick

15. Conway, Christina. Localised sound optimisation in small enclosures.

Degree: 2010, University of Limerick

peer-reviewed

In this work an application was developed which uses the Sequential Quadratic Pro- gramming (SQP) optimisation algorithm to optimise boundary absorption in order to… (more)

Subjects/Keywords: quadratic programming; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Conway, C. (2010). Localised sound optimisation in small enclosures. (Thesis). University of Limerick. Retrieved from http://hdl.handle.net/10344/1625

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

Conway, Christina. “Localised sound optimisation in small enclosures.” 2010. Thesis, University of Limerick. Accessed October 22, 2019. http://hdl.handle.net/10344/1625.

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

MLA Handbook (7th Edition):

Conway, Christina. “Localised sound optimisation in small enclosures.” 2010. Web. 22 Oct 2019.

Vancouver:

Conway C. Localised sound optimisation in small enclosures. [Internet] [Thesis]. University of Limerick; 2010. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10344/1625.

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

Council of Science Editors:

Conway C. Localised sound optimisation in small enclosures. [Thesis]. University of Limerick; 2010. Available from: http://hdl.handle.net/10344/1625

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


University of Alberta

16. Zhu, Pengfei. An FPGA-Based Acceleration Platform for The Auction Algorithm.

Degree: MS, Department of Electrical and Computer Engineering, 2012, University of Alberta

 Auction algorithms have been applied in various linear network problems, such as assignment, transportation, max-flow and shortest path problem. The inherent parallel characteristics of these… (more)

Subjects/Keywords: Auction Algorithm; FPGA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhu, P. (2012). An FPGA-Based Acceleration Platform for The Auction Algorithm. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/2f75r9400

Chicago Manual of Style (16th Edition):

Zhu, Pengfei. “An FPGA-Based Acceleration Platform for The Auction Algorithm.” 2012. Masters Thesis, University of Alberta. Accessed October 22, 2019. https://era.library.ualberta.ca/files/2f75r9400.

MLA Handbook (7th Edition):

Zhu, Pengfei. “An FPGA-Based Acceleration Platform for The Auction Algorithm.” 2012. Web. 22 Oct 2019.

Vancouver:

Zhu P. An FPGA-Based Acceleration Platform for The Auction Algorithm. [Internet] [Masters thesis]. University of Alberta; 2012. [cited 2019 Oct 22]. Available from: https://era.library.ualberta.ca/files/2f75r9400.

Council of Science Editors:

Zhu P. An FPGA-Based Acceleration Platform for The Auction Algorithm. [Masters Thesis]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/2f75r9400


Anna University

17. Suganthi, J. Linear system model reduction using Genetic algorithm; -.

Degree: Information and Communication Engineering, 2014, Anna University

newlineStability is an important property to be possessed by every system newlineSince most of the systems are non linear in nature the analysis about the… (more)

Subjects/Keywords: Genetic algorithm; Stability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Suganthi, J. (2014). Linear system model reduction using Genetic algorithm; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/27448

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

Suganthi, J. “Linear system model reduction using Genetic algorithm; -.” 2014. Thesis, Anna University. Accessed October 22, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/27448.

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

MLA Handbook (7th Edition):

Suganthi, J. “Linear system model reduction using Genetic algorithm; -.” 2014. Web. 22 Oct 2019.

Vancouver:

Suganthi J. Linear system model reduction using Genetic algorithm; -. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Oct 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27448.

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

Council of Science Editors:

Suganthi J. Linear system model reduction using Genetic algorithm; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/27448

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


McMaster University

18. Ge, Hanqing. DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL.

Degree: MASc, 2016, McMaster University

Magnesium is known as one of the lowest density metals. With the increasing importance of fuel economy and the need to reduce weight, magnesium has… (more)

Subjects/Keywords: EVPSC; Genetic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ge, H. (2016). DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/20570

Chicago Manual of Style (16th Edition):

Ge, Hanqing. “DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL.” 2016. Masters Thesis, McMaster University. Accessed October 22, 2019. http://hdl.handle.net/11375/20570.

MLA Handbook (7th Edition):

Ge, Hanqing. “DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL.” 2016. Web. 22 Oct 2019.

Vancouver:

Ge H. DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL. [Internet] [Masters thesis]. McMaster University; 2016. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/11375/20570.

Council of Science Editors:

Ge H. DEVELOPMENT OF A GENETIC ALGORITHM APPROACH TO CALIBRATE THE EVPSC MODEL. [Masters Thesis]. McMaster University; 2016. Available from: http://hdl.handle.net/11375/20570


Cornell University

19. Wan, Ying. Applications Of Multi-Objective, Mixed-Integer And Hybrid Global Optimization Algorithms For Computationally Expensive Groundwater Problems .

Degree: 2015, Cornell University

 This research focuses on the development and implementation of e cient optimization algorithms that can solve a range of computationally expensive groundwater simulationoptimization problems. Because… (more)

Subjects/Keywords: Optimization; Groundwater; Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wan, Y. (2015). Applications Of Multi-Objective, Mixed-Integer And Hybrid Global Optimization Algorithms For Computationally Expensive Groundwater Problems . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/39480

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

Wan, Ying. “Applications Of Multi-Objective, Mixed-Integer And Hybrid Global Optimization Algorithms For Computationally Expensive Groundwater Problems .” 2015. Thesis, Cornell University. Accessed October 22, 2019. http://hdl.handle.net/1813/39480.

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

MLA Handbook (7th Edition):

Wan, Ying. “Applications Of Multi-Objective, Mixed-Integer And Hybrid Global Optimization Algorithms For Computationally Expensive Groundwater Problems .” 2015. Web. 22 Oct 2019.

Vancouver:

Wan Y. Applications Of Multi-Objective, Mixed-Integer And Hybrid Global Optimization Algorithms For Computationally Expensive Groundwater Problems . [Internet] [Thesis]. Cornell University; 2015. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/1813/39480.

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

Council of Science Editors:

Wan Y. Applications Of Multi-Objective, Mixed-Integer And Hybrid Global Optimization Algorithms For Computationally Expensive Groundwater Problems . [Thesis]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/39480

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

20. Chohan, Ossam. University Scheduling using Genetic Algorithm.

Degree: Computer Engineering, 2009, Dalarna University

  The automated timetabling and scheduling is one of the hardest problem areas. This isbecause of constraints and satisfying those constraints to get the feasible… (more)

Subjects/Keywords: timetabling; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chohan, O. (2009). University Scheduling using Genetic Algorithm. (Thesis). Dalarna University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791

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

Chohan, Ossam. “University Scheduling using Genetic Algorithm.” 2009. Thesis, Dalarna University. Accessed October 22, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791.

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

MLA Handbook (7th Edition):

Chohan, Ossam. “University Scheduling using Genetic Algorithm.” 2009. Web. 22 Oct 2019.

Vancouver:

Chohan O. University Scheduling using Genetic Algorithm. [Internet] [Thesis]. Dalarna University; 2009. [cited 2019 Oct 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791.

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

Council of Science Editors:

Chohan O. University Scheduling using Genetic Algorithm. [Thesis]. Dalarna University; 2009. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:du-3791

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

21. Luo, Xiao. Adaptive Signal Processing for SAR Data : Theory and Experimental Results.

Degree: 2014, , Department of Applied Signal Processing

  This thesis presents the theory and the experiment results with adaptive filtering algorithms. The experiments are based on the ultrawideband (UWB) Synthetic Aperture Radar… (more)

Subjects/Keywords: Adaptive filtering; LMS Algorithm; NLMS Algorithm; LLMS Algorithm; RLS Algorithm; MATLAB simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Luo, X. (2014). Adaptive Signal Processing for SAR Data : Theory and Experimental Results. (Thesis). , Department of Applied Signal Processing. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4411

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

Luo, Xiao. “Adaptive Signal Processing for SAR Data : Theory and Experimental Results.” 2014. Thesis, , Department of Applied Signal Processing. Accessed October 22, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4411.

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

MLA Handbook (7th Edition):

Luo, Xiao. “Adaptive Signal Processing for SAR Data : Theory and Experimental Results.” 2014. Web. 22 Oct 2019.

Vancouver:

Luo X. Adaptive Signal Processing for SAR Data : Theory and Experimental Results. [Internet] [Thesis]. , Department of Applied Signal Processing; 2014. [cited 2019 Oct 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4411.

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

Council of Science Editors:

Luo X. Adaptive Signal Processing for SAR Data : Theory and Experimental Results. [Thesis]. , Department of Applied Signal Processing; 2014. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4411

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


Delft University of Technology

22. Chaeron, S.L.A. Ranking the Level of Fear from Voice using Nominal Classification Methods:.

Degree: 2009, Delft University of Technology

 To investigate human emotion, which is conveyed in human speech, methods which can achieve this need to be developed. One way to respond to it… (more)

Subjects/Keywords: Machine learning algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chaeron, S. L. A. (2009). Ranking the Level of Fear from Voice using Nominal Classification Methods:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d537fb74-e1c6-4efc-a661-18704cc170d9

Chicago Manual of Style (16th Edition):

Chaeron, S L A. “Ranking the Level of Fear from Voice using Nominal Classification Methods:.” 2009. Masters Thesis, Delft University of Technology. Accessed October 22, 2019. http://resolver.tudelft.nl/uuid:d537fb74-e1c6-4efc-a661-18704cc170d9.

MLA Handbook (7th Edition):

Chaeron, S L A. “Ranking the Level of Fear from Voice using Nominal Classification Methods:.” 2009. Web. 22 Oct 2019.

Vancouver:

Chaeron SLA. Ranking the Level of Fear from Voice using Nominal Classification Methods:. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2019 Oct 22]. Available from: http://resolver.tudelft.nl/uuid:d537fb74-e1c6-4efc-a661-18704cc170d9.

Council of Science Editors:

Chaeron SLA. Ranking the Level of Fear from Voice using Nominal Classification Methods:. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:d537fb74-e1c6-4efc-a661-18704cc170d9


Stellenbosch University

23. Oloungha, Stephane B. Convergence analysis of symmetric interpolatory subdivision schemes.

Degree: Mathematical Sciences, 2010, Stellenbosch University

Thesis (PhD (Mathematics)) – University of Stellenbosch, 2010.

Contains bibliography.

ENGLISH ABSTRACT: See full text for summary.

AFRIKAANSE OPSOMMING: Sien volteks vir opsomming

Advisors/Committee Members: de Villiers, J. M., University of Stellenbosch. Faculty of Science. Dept. of Mathematical Sciences..

Subjects/Keywords: Mathematics; Cascade algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oloungha, S. B. (2010). Convergence analysis of symmetric interpolatory subdivision schemes. (Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/5268

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

Oloungha, Stephane B. “Convergence analysis of symmetric interpolatory subdivision schemes.” 2010. Thesis, Stellenbosch University. Accessed October 22, 2019. http://hdl.handle.net/10019.1/5268.

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

MLA Handbook (7th Edition):

Oloungha, Stephane B. “Convergence analysis of symmetric interpolatory subdivision schemes.” 2010. Web. 22 Oct 2019.

Vancouver:

Oloungha SB. Convergence analysis of symmetric interpolatory subdivision schemes. [Internet] [Thesis]. Stellenbosch University; 2010. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10019.1/5268.

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

Council of Science Editors:

Oloungha SB. Convergence analysis of symmetric interpolatory subdivision schemes. [Thesis]. Stellenbosch University; 2010. Available from: http://hdl.handle.net/10019.1/5268

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


University of Waterloo

24. Mahajan, Shikha. A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs.

Degree: 2017, University of Waterloo

 Interval graphs—the intersection graphs of one-dimensional intervals—are considered one of the most useful mathematical structures to model real life applications. Interval graphs have been widely… (more)

Subjects/Keywords: Interval Graphs; Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mahajan, S. (2017). A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11765

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

Mahajan, Shikha. “A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs.” 2017. Thesis, University of Waterloo. Accessed October 22, 2019. http://hdl.handle.net/10012/11765.

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

MLA Handbook (7th Edition):

Mahajan, Shikha. “A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs.” 2017. Web. 22 Oct 2019.

Vancouver:

Mahajan S. A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10012/11765.

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

Council of Science Editors:

Mahajan S. A Faster Algorithm for Recognizing Edge-Weighted Interval Graphs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11765

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


Anna University

25. Senthil kumar V. Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;.

Degree: Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem, 2014, Anna University

The main objective of this research is to develop Genetic Algorithm newline GA based algorithms for solving the Unit Commitment UC problems newlinehydrothermal scheduling and… (more)

Subjects/Keywords: Enhanced Genetic Algorithm; Genetic Algorithm; Simple Genetic Algorithm; Unit Commitment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

V, S. k. (2014). Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/28072

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

V, Senthil kumar. “Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;.” 2014. Thesis, Anna University. Accessed October 22, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/28072.

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

MLA Handbook (7th Edition):

V, Senthil kumar. “Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;.” 2014. Web. 22 Oct 2019.

Vancouver:

V Sk. Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;. [Internet] [Thesis]. Anna University; 2014. [cited 2019 Oct 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28072.

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

Council of Science Editors:

V Sk. Artificial intelligence based Algorithms for the optimal solution Of security constrained thermal unit N Commitment and short term Hydrothermal scheduling problem;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28072

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


Brunel University

26. Al-Hajri, Muhammad T. Electrical power energy optimization at hydrocarbon industrial plant using intelligent algorithms.

Degree: PhD, 2016, Brunel University

 In this work, the potential of intelligent algorithms for optimizing the real power loss and enhancing the grid connection power factor in a real hydrocarbon… (more)

Subjects/Keywords: 006.3; Genetic algorithm; Improved strength pareto algorithm; Differential evolutionary algorithm; Real power loss; Economic analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Hajri, M. T. (2016). Electrical power energy optimization at hydrocarbon industrial plant using intelligent algorithms. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/12681 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685462

Chicago Manual of Style (16th Edition):

Al-Hajri, Muhammad T. “Electrical power energy optimization at hydrocarbon industrial plant using intelligent algorithms.” 2016. Doctoral Dissertation, Brunel University. Accessed October 22, 2019. http://bura.brunel.ac.uk/handle/2438/12681 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685462.

MLA Handbook (7th Edition):

Al-Hajri, Muhammad T. “Electrical power energy optimization at hydrocarbon industrial plant using intelligent algorithms.” 2016. Web. 22 Oct 2019.

Vancouver:

Al-Hajri MT. Electrical power energy optimization at hydrocarbon industrial plant using intelligent algorithms. [Internet] [Doctoral dissertation]. Brunel University; 2016. [cited 2019 Oct 22]. Available from: http://bura.brunel.ac.uk/handle/2438/12681 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685462.

Council of Science Editors:

Al-Hajri MT. Electrical power energy optimization at hydrocarbon industrial plant using intelligent algorithms. [Doctoral Dissertation]. Brunel University; 2016. Available from: http://bura.brunel.ac.uk/handle/2438/12681 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.685462


NSYSU

27. Yang, You-Chuan. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.

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

 With the advance of computer and internet technologies, social networks have become an integral part of most peopleâs life. People can now use social networks… (more)

Subjects/Keywords: influence maximization problem; social network; meta-heuristic algorithm; genetic algorithm; NewGreedy algorithm; propagation model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, Y. (2016). A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418

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

Yang, You-Chuan. “A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.” 2016. Thesis, NSYSU. Accessed October 22, 2019. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418.

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

MLA Handbook (7th Edition):

Yang, You-Chuan. “A NewGreedy Genetic Algorithm for Influence Maximization in Social Network.” 2016. Web. 22 Oct 2019.

Vancouver:

Yang Y. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. [Internet] [Thesis]. NSYSU; 2016. [cited 2019 Oct 22]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418.

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

Council of Science Editors:

Yang Y. A NewGreedy Genetic Algorithm for Influence Maximization in Social Network. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0115116-163418

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


Penn State University

28. Homsup, Nathawut. EVALUATION AND ENHANCEMENT OF NATURE-INSPIRED OPTIMIZATION FOR ANTENNA IMPEDANCE MATCHING.

Degree: PhD, Electrical Engineering, 2016, Penn State University

 Advancements in the technology of communication systems have led to increased requirements and constraints on antennas in terms of cost, bandwidth, and many other performance… (more)

Subjects/Keywords: Antenna Design; Impedance Matching; Firefly Algorithm; Nature-Inspired Optimization; Swarm Intelligence Algorithm; Modified Firefly Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Homsup, N. (2016). EVALUATION AND ENHANCEMENT OF NATURE-INSPIRED OPTIMIZATION FOR ANTENNA IMPEDANCE MATCHING. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/13314nuh126

Chicago Manual of Style (16th Edition):

Homsup, Nathawut. “EVALUATION AND ENHANCEMENT OF NATURE-INSPIRED OPTIMIZATION FOR ANTENNA IMPEDANCE MATCHING.” 2016. Doctoral Dissertation, Penn State University. Accessed October 22, 2019. https://etda.libraries.psu.edu/catalog/13314nuh126.

MLA Handbook (7th Edition):

Homsup, Nathawut. “EVALUATION AND ENHANCEMENT OF NATURE-INSPIRED OPTIMIZATION FOR ANTENNA IMPEDANCE MATCHING.” 2016. Web. 22 Oct 2019.

Vancouver:

Homsup N. EVALUATION AND ENHANCEMENT OF NATURE-INSPIRED OPTIMIZATION FOR ANTENNA IMPEDANCE MATCHING. [Internet] [Doctoral dissertation]. Penn State University; 2016. [cited 2019 Oct 22]. Available from: https://etda.libraries.psu.edu/catalog/13314nuh126.

Council of Science Editors:

Homsup N. EVALUATION AND ENHANCEMENT OF NATURE-INSPIRED OPTIMIZATION FOR ANTENNA IMPEDANCE MATCHING. [Doctoral Dissertation]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/13314nuh126


Clemson University

29. Volny, Frank. New Algorithms for Computing Groebner Bases.

Degree: PhD, Mathematical Science, 2011, Clemson University

 In this thesis, we present new algorithms for computing Groebner bases. The first algorithm, G2V, is incremental in the same fashion as F5 and F5C.… (more)

Subjects/Keywords: Buchberger's algorithm; colon ideal; f5 algorithm; Groebner basis; signature based algorithm; syzygy module; Applied Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Volny, F. (2011). New Algorithms for Computing Groebner Bases. (Doctoral Dissertation). Clemson University. Retrieved from https://tigerprints.clemson.edu/all_dissertations/725

Chicago Manual of Style (16th Edition):

Volny, Frank. “New Algorithms for Computing Groebner Bases.” 2011. Doctoral Dissertation, Clemson University. Accessed October 22, 2019. https://tigerprints.clemson.edu/all_dissertations/725.

MLA Handbook (7th Edition):

Volny, Frank. “New Algorithms for Computing Groebner Bases.” 2011. Web. 22 Oct 2019.

Vancouver:

Volny F. New Algorithms for Computing Groebner Bases. [Internet] [Doctoral dissertation]. Clemson University; 2011. [cited 2019 Oct 22]. Available from: https://tigerprints.clemson.edu/all_dissertations/725.

Council of Science Editors:

Volny F. New Algorithms for Computing Groebner Bases. [Doctoral Dissertation]. Clemson University; 2011. Available from: https://tigerprints.clemson.edu/all_dissertations/725


Queensland University of Technology

30. Amarasinghe Arachchilage, Madhushika Madara Erangani Karunarathra. A framework for identification of similarities between multiple algorithms.

Degree: 2015, Queensland University of Technology

 This thesis in software engineering presents a novel automated framework to identify similar operations utilized by multiple algorithms for solving related computing problems. It provides… (more)

Subjects/Keywords: Algorithm analysis; Algorithm clustering; Parameter weighting system; Algorithm similarities; Special-purpose operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Amarasinghe Arachchilage, M. M. E. K. (2015). A framework for identification of similarities between multiple algorithms. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/82784/

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

Amarasinghe Arachchilage, Madhushika Madara Erangani Karunarathra. “A framework for identification of similarities between multiple algorithms.” 2015. Thesis, Queensland University of Technology. Accessed October 22, 2019. https://eprints.qut.edu.au/82784/.

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

MLA Handbook (7th Edition):

Amarasinghe Arachchilage, Madhushika Madara Erangani Karunarathra. “A framework for identification of similarities between multiple algorithms.” 2015. Web. 22 Oct 2019.

Vancouver:

Amarasinghe Arachchilage MMEK. A framework for identification of similarities between multiple algorithms. [Internet] [Thesis]. Queensland University of Technology; 2015. [cited 2019 Oct 22]. Available from: https://eprints.qut.edu.au/82784/.

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

Council of Science Editors:

Amarasinghe Arachchilage MMEK. A framework for identification of similarities between multiple algorithms. [Thesis]. Queensland University of Technology; 2015. Available from: https://eprints.qut.edu.au/82784/

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

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

.