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

[1] [2] [3] [4] [5]

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Manchester

1. Money, Daniel. Model and Algorithm Development in Computational Phylogenetics.

Degree: 2011, University of Manchester

 Phylogenetic trees play an important role in many areas of biological research fromhelping us to better understand the process of evolution to drug discovery. Researchersin… (more)

Subjects/Keywords: Phylogenetics; Gene family; Tree search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Money, D. (2011). Model and Algorithm Development in Computational Phylogenetics. (Doctoral Dissertation). University of Manchester. Retrieved from http://www.manchester.ac.uk/escholar/uk-ac-man-scw:134934

Chicago Manual of Style (16th Edition):

Money, Daniel. “Model and Algorithm Development in Computational Phylogenetics.” 2011. Doctoral Dissertation, University of Manchester. Accessed October 17, 2019. http://www.manchester.ac.uk/escholar/uk-ac-man-scw:134934.

MLA Handbook (7th Edition):

Money, Daniel. “Model and Algorithm Development in Computational Phylogenetics.” 2011. Web. 17 Oct 2019.

Vancouver:

Money D. Model and Algorithm Development in Computational Phylogenetics. [Internet] [Doctoral dissertation]. University of Manchester; 2011. [cited 2019 Oct 17]. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:134934.

Council of Science Editors:

Money D. Model and Algorithm Development in Computational Phylogenetics. [Doctoral Dissertation]. University of Manchester; 2011. Available from: http://www.manchester.ac.uk/escholar/uk-ac-man-scw:134934


University of Manchester

2. Money, Daniel. Model and algorithm development in computational phylogenetics.

Degree: PhD, 2012, University of Manchester

 Phylogenetic trees play an important role in many areas of biological research, from helping us to better understand the process of evolution to drug discovery.… (more)

Subjects/Keywords: Tree search; Gene family; Phylogenetics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Money, D. (2012). Model and algorithm development in computational phylogenetics. (Doctoral Dissertation). University of Manchester. Retrieved from https://www.research.manchester.ac.uk/portal/en/theses/model-and-algorithm-development-in-computational-phylogenetics(85745e40-bde4-482d-b614-f79130821e7d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.771286

Chicago Manual of Style (16th Edition):

Money, Daniel. “Model and algorithm development in computational phylogenetics.” 2012. Doctoral Dissertation, University of Manchester. Accessed October 17, 2019. https://www.research.manchester.ac.uk/portal/en/theses/model-and-algorithm-development-in-computational-phylogenetics(85745e40-bde4-482d-b614-f79130821e7d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.771286.

MLA Handbook (7th Edition):

Money, Daniel. “Model and algorithm development in computational phylogenetics.” 2012. Web. 17 Oct 2019.

Vancouver:

Money D. Model and algorithm development in computational phylogenetics. [Internet] [Doctoral dissertation]. University of Manchester; 2012. [cited 2019 Oct 17]. Available from: https://www.research.manchester.ac.uk/portal/en/theses/model-and-algorithm-development-in-computational-phylogenetics(85745e40-bde4-482d-b614-f79130821e7d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.771286.

Council of Science Editors:

Money D. Model and algorithm development in computational phylogenetics. [Doctoral Dissertation]. University of Manchester; 2012. Available from: https://www.research.manchester.ac.uk/portal/en/theses/model-and-algorithm-development-in-computational-phylogenetics(85745e40-bde4-482d-b614-f79130821e7d).html ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.771286


Universiteit Utrecht

3. Eeden, J.G. van. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.

Degree: 2015, Universiteit Utrecht

 In the ongoing strive to reach human-level intelligence with intelligent agents, it has become clear that the agents should be able to deal with a… (more)

Subjects/Keywords: Monte Carlo Tree Search; MCTS; AI; Artificial Intelligence; algorithm; tree search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eeden, J. G. v. (2015). Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/315915

Chicago Manual of Style (16th Edition):

Eeden, J G van. “Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.” 2015. Masters Thesis, Universiteit Utrecht. Accessed October 17, 2019. http://dspace.library.uu.nl:8080/handle/1874/315915.

MLA Handbook (7th Edition):

Eeden, J G van. “Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm.” 2015. Web. 17 Oct 2019.

Vancouver:

Eeden JGv. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. [Internet] [Masters thesis]. Universiteit Utrecht; 2015. [cited 2019 Oct 17]. Available from: http://dspace.library.uu.nl:8080/handle/1874/315915.

Council of Science Editors:

Eeden JGv. Analysing And Improving The Knowledge-based Fast Evolutionary MCTS Algorithm. [Masters Thesis]. Universiteit Utrecht; 2015. Available from: http://dspace.library.uu.nl:8080/handle/1874/315915


Cornell University

4. Ramanujan, Raghuram. Understanding Sampling-Based Adversarial Search Methods .

Degree: 2012, Cornell University

 Until 2007, the best computer programs for playing the board game Go performed at the level of a weak amateur, while employing the same Minimax… (more)

Subjects/Keywords: Minimax; Game Playing; Monte Carlo Tree Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramanujan, R. (2012). Understanding Sampling-Based Adversarial Search Methods . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/31138

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

Ramanujan, Raghuram. “Understanding Sampling-Based Adversarial Search Methods .” 2012. Thesis, Cornell University. Accessed October 17, 2019. http://hdl.handle.net/1813/31138.

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

MLA Handbook (7th Edition):

Ramanujan, Raghuram. “Understanding Sampling-Based Adversarial Search Methods .” 2012. Web. 17 Oct 2019.

Vancouver:

Ramanujan R. Understanding Sampling-Based Adversarial Search Methods . [Internet] [Thesis]. Cornell University; 2012. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/1813/31138.

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

Council of Science Editors:

Ramanujan R. Understanding Sampling-Based Adversarial Search Methods . [Thesis]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31138

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


Université Catholique de Louvain

5. Vandermosten, Thibault. Monte Carlo Tree Search applied to Go : reaching omega.

Degree: 2016, Université Catholique de Louvain

This thesis is about designing an artificial intelligence Go player based on Monte Carlo Tree Search, or MCTS, techniques, with the lower bound complexity. Go… (more)

Subjects/Keywords: Monte Carlo Tree Search; Go; Lower bound complexity; Data Structures; Optimization; Monte Carlo; Tree Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vandermosten, T. (2016). Monte Carlo Tree Search applied to Go : reaching omega. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/thesis:4607

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

Vandermosten, Thibault. “Monte Carlo Tree Search applied to Go : reaching omega.” 2016. Thesis, Université Catholique de Louvain. Accessed October 17, 2019. http://hdl.handle.net/2078.1/thesis:4607.

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

MLA Handbook (7th Edition):

Vandermosten, Thibault. “Monte Carlo Tree Search applied to Go : reaching omega.” 2016. Web. 17 Oct 2019.

Vancouver:

Vandermosten T. Monte Carlo Tree Search applied to Go : reaching omega. [Internet] [Thesis]. Université Catholique de Louvain; 2016. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/2078.1/thesis:4607.

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

Council of Science Editors:

Vandermosten T. Monte Carlo Tree Search applied to Go : reaching omega. [Thesis]. Université Catholique de Louvain; 2016. Available from: http://hdl.handle.net/2078.1/thesis:4607

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


California State University – Sacramento

6. Shah, Parth. Net camera interface using Rabbit Microprocessor development board RCM3365.

Degree: MS, Electrical and Electronic Engineering, 2011, California State University – Sacramento

 In this high technology world, as we know in day to day life the importance of different application using internet is becoming widespread. Rapid growth… (more)

Subjects/Keywords: Rabbit Microprocessor; Camera interface; Binary search; B + tree; B * - tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shah, P. (2011). Net camera interface using Rabbit Microprocessor development board RCM3365. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.9/1276

Chicago Manual of Style (16th Edition):

Shah, Parth. “Net camera interface using Rabbit Microprocessor development board RCM3365.” 2011. Masters Thesis, California State University – Sacramento. Accessed October 17, 2019. http://hdl.handle.net/10211.9/1276.

MLA Handbook (7th Edition):

Shah, Parth. “Net camera interface using Rabbit Microprocessor development board RCM3365.” 2011. Web. 17 Oct 2019.

Vancouver:

Shah P. Net camera interface using Rabbit Microprocessor development board RCM3365. [Internet] [Masters thesis]. California State University – Sacramento; 2011. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10211.9/1276.

Council of Science Editors:

Shah P. Net camera interface using Rabbit Microprocessor development board RCM3365. [Masters Thesis]. California State University – Sacramento; 2011. Available from: http://hdl.handle.net/10211.9/1276


University of Alberta

7. Zhang, Yeqin. TDS+: Improving Temperature Discovery Search.

Degree: MS, Department of Computing Science, 2015, University of Alberta

 Temperature Discovery Search (TDS) is a forward search method for computing or approximating the temperature of a combinatorial game. Temperature and mean are important concepts… (more)

Subjects/Keywords: game tree search; TDS+; Amazons; combinatorial game theory; Temperature Discovery Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, Y. (2015). TDS+: Improving Temperature Discovery Search. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/mw22v792c

Chicago Manual of Style (16th Edition):

Zhang, Yeqin. “TDS+: Improving Temperature Discovery Search.” 2015. Masters Thesis, University of Alberta. Accessed October 17, 2019. https://era.library.ualberta.ca/files/mw22v792c.

MLA Handbook (7th Edition):

Zhang, Yeqin. “TDS+: Improving Temperature Discovery Search.” 2015. Web. 17 Oct 2019.

Vancouver:

Zhang Y. TDS+: Improving Temperature Discovery Search. [Internet] [Masters thesis]. University of Alberta; 2015. [cited 2019 Oct 17]. Available from: https://era.library.ualberta.ca/files/mw22v792c.

Council of Science Editors:

Zhang Y. TDS+: Improving Temperature Discovery Search. [Masters Thesis]. University of Alberta; 2015. Available from: https://era.library.ualberta.ca/files/mw22v792c

8. Finley, Laura. Nested Monte Carlo Tree Search as Applied to Samurai Sudoku.

Degree: MS, Mathematics, 2016, Governors State University

  As Sudoku has come into prominence as a favorite logic puzzle, mathematicians and computer scientists alike have analyzed the game for interesting properties. The… (more)

Subjects/Keywords: Sudoku; Samurai Sudoku; Monte Carlo search; rollouts; solver; tree search; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Finley, L. (2016). Nested Monte Carlo Tree Search as Applied to Samurai Sudoku. (Thesis). Governors State University. Retrieved from http://opus.govst.edu/theses/72

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

Finley, Laura. “Nested Monte Carlo Tree Search as Applied to Samurai Sudoku.” 2016. Thesis, Governors State University. Accessed October 17, 2019. http://opus.govst.edu/theses/72.

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

MLA Handbook (7th Edition):

Finley, Laura. “Nested Monte Carlo Tree Search as Applied to Samurai Sudoku.” 2016. Web. 17 Oct 2019.

Vancouver:

Finley L. Nested Monte Carlo Tree Search as Applied to Samurai Sudoku. [Internet] [Thesis]. Governors State University; 2016. [cited 2019 Oct 17]. Available from: http://opus.govst.edu/theses/72.

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

Council of Science Editors:

Finley L. Nested Monte Carlo Tree Search as Applied to Samurai Sudoku. [Thesis]. Governors State University; 2016. Available from: http://opus.govst.edu/theses/72

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


University of Minnesota

9. Kartal, Bilal. Stochastic Tree Search for Highly Coordinated Planning.

Degree: PhD, Computer Science, 2016, University of Minnesota

 Coordination plays a key role in efficiently solving multi-agent problems such as exploration of unknown environments, search and rescue, and surveillance. Planning in a highly… (more)

Subjects/Keywords: Coordination; Monte Carlo Tree Search; Planning; Robotics; Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kartal, B. (2016). Stochastic Tree Search for Highly Coordinated Planning. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/183362

Chicago Manual of Style (16th Edition):

Kartal, Bilal. “Stochastic Tree Search for Highly Coordinated Planning.” 2016. Doctoral Dissertation, University of Minnesota. Accessed October 17, 2019. http://hdl.handle.net/11299/183362.

MLA Handbook (7th Edition):

Kartal, Bilal. “Stochastic Tree Search for Highly Coordinated Planning.” 2016. Web. 17 Oct 2019.

Vancouver:

Kartal B. Stochastic Tree Search for Highly Coordinated Planning. [Internet] [Doctoral dissertation]. University of Minnesota; 2016. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/11299/183362.

Council of Science Editors:

Kartal B. Stochastic Tree Search for Highly Coordinated Planning. [Doctoral Dissertation]. University of Minnesota; 2016. Available from: http://hdl.handle.net/11299/183362


Brno University of Technology

10. Slávka, Michal. Neuronové sítě pro hru gomoku .

Degree: 2019, Brno University of Technology

 Táto práca sa zaoberá použitím algoritmu AlphaZero pre hru Gomoku. AlphaZero je založený na spätnoväzbnom učení a k trénovaniu nemusia byť využité žiadne existujúce datasety.… (more)

Subjects/Keywords: neurónové siete; Monte Carlo tree search; AlphaZero; backpropagation; reinforcement learning; neural networks; Monte Carlo tree search; AlphaZero; backpropagation; reinforcement learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Slávka, M. (2019). Neuronové sítě pro hru gomoku . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/180191

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

Slávka, Michal. “Neuronové sítě pro hru gomoku .” 2019. Thesis, Brno University of Technology. Accessed October 17, 2019. http://hdl.handle.net/11012/180191.

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

MLA Handbook (7th Edition):

Slávka, Michal. “Neuronové sítě pro hru gomoku .” 2019. Web. 17 Oct 2019.

Vancouver:

Slávka M. Neuronové sítě pro hru gomoku . [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/11012/180191.

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

Council of Science Editors:

Slávka M. Neuronové sítě pro hru gomoku . [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/180191

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


Dalhousie University

11. Li, Mengdu. Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees.

Degree: Master of Computer Science, Faculty of Computer Science, 2016, Dalhousie University

 We present a provably linearizable and lock-free relaxed AVL tree called the non- blocking ravl tree. At any time, the height of a non-blocking ravl… (more)

Subjects/Keywords: concurrent data structure; non-blocking; self-balancing binary search tree; relaxed AVL tree; amortized complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Li, M. (2016). Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees. (Masters Thesis). Dalhousie University. Retrieved from http://hdl.handle.net/10222/71623

Chicago Manual of Style (16th Edition):

Li, Mengdu. “Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees.” 2016. Masters Thesis, Dalhousie University. Accessed October 17, 2019. http://hdl.handle.net/10222/71623.

MLA Handbook (7th Edition):

Li, Mengdu. “Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees.” 2016. Web. 17 Oct 2019.

Vancouver:

Li M. Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees. [Internet] [Masters thesis]. Dalhousie University; 2016. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10222/71623.

Council of Science Editors:

Li M. Deletion Without Rebalancing in Non-Blocking Self-Balancing Binary Search Trees. [Masters Thesis]. Dalhousie University; 2016. Available from: http://hdl.handle.net/10222/71623


University of Alberta

12. Churchill, David G. Heuristic Search Techniques for Real-Time Strategy Games.

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

 Real-time strategy (RTS) video games are known for being one of the most complex and strategic games for humans to play. With a unique combination… (more)

Subjects/Keywords: artificial intelligence; heuristic search; real-time strategy games; monte-carlo tree search; starcraft

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Churchill, D. G. (2016). Heuristic Search Techniques for Real-Time Strategy Games. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cft848q99j

Chicago Manual of Style (16th Edition):

Churchill, David G. “Heuristic Search Techniques for Real-Time Strategy Games.” 2016. Doctoral Dissertation, University of Alberta. Accessed October 17, 2019. https://era.library.ualberta.ca/files/cft848q99j.

MLA Handbook (7th Edition):

Churchill, David G. “Heuristic Search Techniques for Real-Time Strategy Games.” 2016. Web. 17 Oct 2019.

Vancouver:

Churchill DG. Heuristic Search Techniques for Real-Time Strategy Games. [Internet] [Doctoral dissertation]. University of Alberta; 2016. [cited 2019 Oct 17]. Available from: https://era.library.ualberta.ca/files/cft848q99j.

Council of Science Editors:

Churchill DG. Heuristic Search Techniques for Real-Time Strategy Games. [Doctoral Dissertation]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/cft848q99j


University of Ontario Institute of Technology

13. Wang, Mengyu. Efficient data search and synchronization for tree-structured data on mobile devices.

Degree: 2015, University of Ontario Institute of Technology

 We consider two methods about operating data for tree-structured data sets. The first method is to search particular data items and still retains all the… (more)

Subjects/Keywords: Bloom filters; Tree-structured data; Data search; Data synchronization; Mobile devices

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, M. (2015). Efficient data search and synchronization for tree-structured data on mobile devices. (Thesis). University of Ontario Institute of Technology. Retrieved from http://hdl.handle.net/10155/605

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

Wang, Mengyu. “Efficient data search and synchronization for tree-structured data on mobile devices.” 2015. Thesis, University of Ontario Institute of Technology. Accessed October 17, 2019. http://hdl.handle.net/10155/605.

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

MLA Handbook (7th Edition):

Wang, Mengyu. “Efficient data search and synchronization for tree-structured data on mobile devices.” 2015. Web. 17 Oct 2019.

Vancouver:

Wang M. Efficient data search and synchronization for tree-structured data on mobile devices. [Internet] [Thesis]. University of Ontario Institute of Technology; 2015. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10155/605.

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

Council of Science Editors:

Wang M. Efficient data search and synchronization for tree-structured data on mobile devices. [Thesis]. University of Ontario Institute of Technology; 2015. Available from: http://hdl.handle.net/10155/605

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


University of Alberta

14. Vafadost, Mostafa. Temporal Abstraction in Monte Carlo Tree Search.

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

 Given nothing but the generative model of the environment, Monte Carlo Tree Search techniques have recently shown spectacular results on domains previously thought to be… (more)

Subjects/Keywords: Monte Carlo Tree Search; Temporal Abstraction; Computer Games; Artificial Intelligence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vafadost, M. (2013). Temporal Abstraction in Monte Carlo Tree Search. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/7p88ch13m

Chicago Manual of Style (16th Edition):

Vafadost, Mostafa. “Temporal Abstraction in Monte Carlo Tree Search.” 2013. Masters Thesis, University of Alberta. Accessed October 17, 2019. https://era.library.ualberta.ca/files/7p88ch13m.

MLA Handbook (7th Edition):

Vafadost, Mostafa. “Temporal Abstraction in Monte Carlo Tree Search.” 2013. Web. 17 Oct 2019.

Vancouver:

Vafadost M. Temporal Abstraction in Monte Carlo Tree Search. [Internet] [Masters thesis]. University of Alberta; 2013. [cited 2019 Oct 17]. Available from: https://era.library.ualberta.ca/files/7p88ch13m.

Council of Science Editors:

Vafadost M. Temporal Abstraction in Monte Carlo Tree Search. [Masters Thesis]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/7p88ch13m


University of Alberta

15. Farajmandi, Mahmoud. MODULES MULTI-LIFT PLANNING ON INDUSTRIAL SITE: DEVELOPMENTS OF DECISION SUPPORT TOOLS.

Degree: MS, Department of Civil and Environmental Engineering, 2016, University of Alberta

 Properly planning module installation on industrial sites is a critical factor in ensuring that projects are delivered safely, on time, and within budget. In industrial… (more)

Subjects/Keywords: Module; Mobile Crane; Multi-lift; Heuristic; Monte Carlo Tree Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farajmandi, M. (2016). MODULES MULTI-LIFT PLANNING ON INDUSTRIAL SITE: DEVELOPMENTS OF DECISION SUPPORT TOOLS. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cz029p4958

Chicago Manual of Style (16th Edition):

Farajmandi, Mahmoud. “MODULES MULTI-LIFT PLANNING ON INDUSTRIAL SITE: DEVELOPMENTS OF DECISION SUPPORT TOOLS.” 2016. Masters Thesis, University of Alberta. Accessed October 17, 2019. https://era.library.ualberta.ca/files/cz029p4958.

MLA Handbook (7th Edition):

Farajmandi, Mahmoud. “MODULES MULTI-LIFT PLANNING ON INDUSTRIAL SITE: DEVELOPMENTS OF DECISION SUPPORT TOOLS.” 2016. Web. 17 Oct 2019.

Vancouver:

Farajmandi M. MODULES MULTI-LIFT PLANNING ON INDUSTRIAL SITE: DEVELOPMENTS OF DECISION SUPPORT TOOLS. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2019 Oct 17]. Available from: https://era.library.ualberta.ca/files/cz029p4958.

Council of Science Editors:

Farajmandi M. MODULES MULTI-LIFT PLANNING ON INDUSTRIAL SITE: DEVELOPMENTS OF DECISION SUPPORT TOOLS. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/cz029p4958


Louisiana State University

16. Ding, Song. Optimal binary trees with height restrictions on left and right branches.

Degree: MS, Applied Mathematics, 2006, Louisiana State University

 We begin with background definitions on binary trees. Then we review known algorithms for finding optimal binary search trees. Knuth's famous algorithm, presented in the… (more)

Subjects/Keywords: knuth's algorithm; binary search tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ding, S. (2006). Optimal binary trees with height restrictions on left and right branches. (Masters Thesis). Louisiana State University. Retrieved from etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217

Chicago Manual of Style (16th Edition):

Ding, Song. “Optimal binary trees with height restrictions on left and right branches.” 2006. Masters Thesis, Louisiana State University. Accessed October 17, 2019. etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217.

MLA Handbook (7th Edition):

Ding, Song. “Optimal binary trees with height restrictions on left and right branches.” 2006. Web. 17 Oct 2019.

Vancouver:

Ding S. Optimal binary trees with height restrictions on left and right branches. [Internet] [Masters thesis]. Louisiana State University; 2006. [cited 2019 Oct 17]. Available from: etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217.

Council of Science Editors:

Ding S. Optimal binary trees with height restrictions on left and right branches. [Masters Thesis]. Louisiana State University; 2006. Available from: etd-07122006-160111 ; https://digitalcommons.lsu.edu/gradschool_theses/3217


George Mason University

17. Roufarshbaf, Hossein. A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking .

Degree: 2011, George Mason University

 We propose complexity efficient tree search approaches to detection and estimation problems, and we consider both communication and target tracking applications in this regard. We… (more)

Subjects/Keywords: Target Tracking; Tree Search; Modulation Classification; Stack Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Roufarshbaf, H. (2011). A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/6584

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

Roufarshbaf, Hossein. “A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking .” 2011. Thesis, George Mason University. Accessed October 17, 2019. http://hdl.handle.net/1920/6584.

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

MLA Handbook (7th Edition):

Roufarshbaf, Hossein. “A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking .” 2011. Web. 17 Oct 2019.

Vancouver:

Roufarshbaf H. A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking . [Internet] [Thesis]. George Mason University; 2011. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/1920/6584.

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

Council of Science Editors:

Roufarshbaf H. A Tree Search Approach to Detection and Estimation with Application to Communications and Tracking . [Thesis]. George Mason University; 2011. Available from: http://hdl.handle.net/1920/6584

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


University of Notre Dame

18. Marcin Sikora. Reduced-Complexity Algorithms for Decoding and Equalization</h1>.

Degree: PhD, Electrical Engineering, 2008, University of Notre Dame

  Finite state machines (FSMs) and detection problems involving them are frequently encountered in digital communication systems for noisy channels. One type of FSM arises… (more)

Subjects/Keywords: tree search; decoding; equalization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sikora, M. (2008). Reduced-Complexity Algorithms for Decoding and Equalization</h1>. (Doctoral Dissertation). University of Notre Dame. Retrieved from https://curate.nd.edu/show/4b29b566186

Chicago Manual of Style (16th Edition):

Sikora, Marcin. “Reduced-Complexity Algorithms for Decoding and Equalization</h1>.” 2008. Doctoral Dissertation, University of Notre Dame. Accessed October 17, 2019. https://curate.nd.edu/show/4b29b566186.

MLA Handbook (7th Edition):

Sikora, Marcin. “Reduced-Complexity Algorithms for Decoding and Equalization</h1>.” 2008. Web. 17 Oct 2019.

Vancouver:

Sikora M. Reduced-Complexity Algorithms for Decoding and Equalization</h1>. [Internet] [Doctoral dissertation]. University of Notre Dame; 2008. [cited 2019 Oct 17]. Available from: https://curate.nd.edu/show/4b29b566186.

Council of Science Editors:

Sikora M. Reduced-Complexity Algorithms for Decoding and Equalization</h1>. [Doctoral Dissertation]. University of Notre Dame; 2008. Available from: https://curate.nd.edu/show/4b29b566186

19. Carosia, Arthur Emanuel de Oliveira. Algoritmos de bulk-loading para o método de acesso métrico Onion-tree.

Degree: Mestrado, Ciências de Computação e Matemática Computacional, 2013, University of São Paulo

Atualmente, a Onion-tree [Carélo et al., 2009] é o método de acesso métrico baseado em memória primária mais eficiente para pesquisa por similaridade disponível na… (more)

Subjects/Keywords: Bulk-loading; Bulk-loading; Consultas por similaridade; Método de acesso métrico; Metric access method; Onion-tree; Onion-tree; Similarity search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carosia, A. E. d. O. (2013). Algoritmos de bulk-loading para o método de acesso métrico Onion-tree. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10122013-164130/ ;

Chicago Manual of Style (16th Edition):

Carosia, Arthur Emanuel de Oliveira. “Algoritmos de bulk-loading para o método de acesso métrico Onion-tree.” 2013. Masters Thesis, University of São Paulo. Accessed October 17, 2019. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10122013-164130/ ;.

MLA Handbook (7th Edition):

Carosia, Arthur Emanuel de Oliveira. “Algoritmos de bulk-loading para o método de acesso métrico Onion-tree.” 2013. Web. 17 Oct 2019.

Vancouver:

Carosia AEdO. Algoritmos de bulk-loading para o método de acesso métrico Onion-tree. [Internet] [Masters thesis]. University of São Paulo; 2013. [cited 2019 Oct 17]. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10122013-164130/ ;.

Council of Science Editors:

Carosia AEdO. Algoritmos de bulk-loading para o método de acesso métrico Onion-tree. [Masters Thesis]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10122013-164130/ ;


University of Alberta

20. Henderson, Philip. Playing and solving the game of Hex.

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

 The game of Hex is of interest to the mathematics, algorithms, and artificial intelligence communities. It is a classical PSPACE-complete problem, and its invention is… (more)

Subjects/Keywords: algorithms; games; combinatorial game theory; automated solver; Monte Carlo tree search; Hex; proof number search; PSPACE-complete; artificial intelligence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Henderson, P. (2010). Playing and solving the game of Hex. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/b8515n53c

Chicago Manual of Style (16th Edition):

Henderson, Philip. “Playing and solving the game of Hex.” 2010. Doctoral Dissertation, University of Alberta. Accessed October 17, 2019. https://era.library.ualberta.ca/files/b8515n53c.

MLA Handbook (7th Edition):

Henderson, Philip. “Playing and solving the game of Hex.” 2010. Web. 17 Oct 2019.

Vancouver:

Henderson P. Playing and solving the game of Hex. [Internet] [Doctoral dissertation]. University of Alberta; 2010. [cited 2019 Oct 17]. Available from: https://era.library.ualberta.ca/files/b8515n53c.

Council of Science Editors:

Henderson P. Playing and solving the game of Hex. [Doctoral Dissertation]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/b8515n53c

21. Karoui, Wafa. Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems.

Degree: Docteur es, Systèmes industriels, 2010, Toulouse, INSA; Université de Tunis El Manar

Le formalisme « Problème de Satisfaction de Contraintes » (ou CSP pour Constraint Satisfaction Problem) peut être considéré comme un langage de représentation formelle qui… (more)

Subjects/Keywords: Heuristiques; Ordonnancement; Problèmes de satisfaction de contraintes; Recherche arborescente; Recherche à divergences; Heuristics; Scheduling; Constraint Satisfaction Problems; Tree search; Discrepancy search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karoui, W. (2010). Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems. (Doctoral Dissertation). Toulouse, INSA; Université de Tunis El Manar. Retrieved from http://www.theses.fr/2010ISAT0021

Chicago Manual of Style (16th Edition):

Karoui, Wafa. “Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems.” 2010. Doctoral Dissertation, Toulouse, INSA; Université de Tunis El Manar. Accessed October 17, 2019. http://www.theses.fr/2010ISAT0021.

MLA Handbook (7th Edition):

Karoui, Wafa. “Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems.” 2010. Web. 17 Oct 2019.

Vancouver:

Karoui W. Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems. [Internet] [Doctoral dissertation]. Toulouse, INSA; Université de Tunis El Manar; 2010. [cited 2019 Oct 17]. Available from: http://www.theses.fr/2010ISAT0021.

Council of Science Editors:

Karoui W. Méthodes à divergences pour la résolution de problèmes de satisfaction de contraintes et d'optimisation combinatoire : Discrepancy-based search for constraint satisfaction and combinatorial optimisation problems. [Doctoral Dissertation]. Toulouse, INSA; Université de Tunis El Manar; 2010. Available from: http://www.theses.fr/2010ISAT0021

22. Tang, Xun. Efficient Similarity Search with Cache-Conscious Data Traversal.

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

 Similarity search is important for many data-intensive applications to identify a set of similar objects. Examples of such applications include near-duplicate detection and clustering, collaborative… (more)

Subjects/Keywords: Computer science; all-pairs similarity search; cache locality optimization; information retrieval; load balance; search result ranking; tree-based ensemble model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tang, X. (2015). Efficient Similarity Search with Cache-Conscious Data Traversal. (Thesis). University of California – eScholarship, University of California. Retrieved from http://www.escholarship.org/uc/item/8jp150jd

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

Tang, Xun. “Efficient Similarity Search with Cache-Conscious Data Traversal.” 2015. Thesis, University of California – eScholarship, University of California. Accessed October 17, 2019. http://www.escholarship.org/uc/item/8jp150jd.

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

MLA Handbook (7th Edition):

Tang, Xun. “Efficient Similarity Search with Cache-Conscious Data Traversal.” 2015. Web. 17 Oct 2019.

Vancouver:

Tang X. Efficient Similarity Search with Cache-Conscious Data Traversal. [Internet] [Thesis]. University of California – eScholarship, University of California; 2015. [cited 2019 Oct 17]. Available from: http://www.escholarship.org/uc/item/8jp150jd.

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

Council of Science Editors:

Tang X. Efficient Similarity Search with Cache-Conscious Data Traversal. [Thesis]. University of California – eScholarship, University of California; 2015. Available from: http://www.escholarship.org/uc/item/8jp150jd

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


Linnaeus University

23. Öfverman, Jakob. Information Presentation in Search Engines on Mobile Devices.

Degree: Physics and Mathematics, 2010, Linnaeus University

  This thesis discusses the possibilities to visualise the presentation layer of a search engine on a mobile device in an alternative way. Previous work… (more)

Subjects/Keywords: Mobile search engines; mobile mock-up; mobile interaction; web 3.0; tree-map visualisations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Öfverman, J. (2010). Information Presentation in Search Engines on Mobile Devices. (Thesis). Linnaeus University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-7945

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

Öfverman, Jakob. “Information Presentation in Search Engines on Mobile Devices.” 2010. Thesis, Linnaeus University. Accessed October 17, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-7945.

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

MLA Handbook (7th Edition):

Öfverman, Jakob. “Information Presentation in Search Engines on Mobile Devices.” 2010. Web. 17 Oct 2019.

Vancouver:

Öfverman J. Information Presentation in Search Engines on Mobile Devices. [Internet] [Thesis]. Linnaeus University; 2010. [cited 2019 Oct 17]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-7945.

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

Council of Science Editors:

Öfverman J. Information Presentation in Search Engines on Mobile Devices. [Thesis]. Linnaeus University; 2010. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-7945

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

24. Aliotta, Marco Antonio. Data mining techniques on volcano monitoring.

Degree: 2013, Università degli Studi di Catania

 The aim of this thesis is the study of data mining process able to discover implicit information from huge amount of data. In particular, indexing… (more)

Subjects/Keywords: Area 01 - Scienze matematiche e informatiche; data mining, indexing, k-pole tree, similarity search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Aliotta, M. A. (2013). Data mining techniques on volcano monitoring. (Thesis). Università degli Studi di Catania. Retrieved from http://hdl.handle.net/10761/1364

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

Aliotta, Marco Antonio. “Data mining techniques on volcano monitoring.” 2013. Thesis, Università degli Studi di Catania. Accessed October 17, 2019. http://hdl.handle.net/10761/1364.

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

MLA Handbook (7th Edition):

Aliotta, Marco Antonio. “Data mining techniques on volcano monitoring.” 2013. Web. 17 Oct 2019.

Vancouver:

Aliotta MA. Data mining techniques on volcano monitoring. [Internet] [Thesis]. Università degli Studi di Catania; 2013. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/10761/1364.

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

Council of Science Editors:

Aliotta MA. Data mining techniques on volcano monitoring. [Thesis]. Università degli Studi di Catania; 2013. Available from: http://hdl.handle.net/10761/1364

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


University of Alberta

25. Naddaf, Yavar. Game-independent AI agents for playing Atari 2600 console games.

Degree: MS, Department of Computing Science, 2010, University of Alberta

 This research focuses on developing AI agents that play arbitrary Atari 2600 console games without having any game-specific assumptions or prior knowledge. Two main approaches… (more)

Subjects/Keywords: Artificial Intelligence; Atari 2600; Tree Search; Games; Reinforcement Learning; UCT; Sarsa Lambda

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Naddaf, Y. (2010). Game-independent AI agents for playing Atari 2600 console games. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/5t34sj65s

Chicago Manual of Style (16th Edition):

Naddaf, Yavar. “Game-independent AI agents for playing Atari 2600 console games.” 2010. Masters Thesis, University of Alberta. Accessed October 17, 2019. https://era.library.ualberta.ca/files/5t34sj65s.

MLA Handbook (7th Edition):

Naddaf, Yavar. “Game-independent AI agents for playing Atari 2600 console games.” 2010. Web. 17 Oct 2019.

Vancouver:

Naddaf Y. Game-independent AI agents for playing Atari 2600 console games. [Internet] [Masters thesis]. University of Alberta; 2010. [cited 2019 Oct 17]. Available from: https://era.library.ualberta.ca/files/5t34sj65s.

Council of Science Editors:

Naddaf Y. Game-independent AI agents for playing Atari 2600 console games. [Masters Thesis]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/5t34sj65s


University of California – Irvine

26. Alsubaiee, Sattam. Spatial Indexing in the Era of Social Media.

Degree: Computer Science, 2014, University of California – Irvine

 The rapid adoption of smart phones and the social media boom has increased the interest in location-based services. A new set of applications and popular… (more)

Subjects/Keywords: Computer science; Approximate Search; Big Data; Location-based; LSM Tree; Spatial Database; Spatial Index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alsubaiee, S. (2014). Spatial Indexing in the Era of Social Media. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/9f1031s2

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

Alsubaiee, Sattam. “Spatial Indexing in the Era of Social Media.” 2014. Thesis, University of California – Irvine. Accessed October 17, 2019. http://www.escholarship.org/uc/item/9f1031s2.

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

MLA Handbook (7th Edition):

Alsubaiee, Sattam. “Spatial Indexing in the Era of Social Media.” 2014. Web. 17 Oct 2019.

Vancouver:

Alsubaiee S. Spatial Indexing in the Era of Social Media. [Internet] [Thesis]. University of California – Irvine; 2014. [cited 2019 Oct 17]. Available from: http://www.escholarship.org/uc/item/9f1031s2.

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

Council of Science Editors:

Alsubaiee S. Spatial Indexing in the Era of Social Media. [Thesis]. University of California – Irvine; 2014. Available from: http://www.escholarship.org/uc/item/9f1031s2

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


University of California – Berkeley

27. Hay, Nicholas James. Principles of Metalevel Control.

Degree: Computer Science, 2016, University of California – Berkeley

 Intelligent agents perform computations to help them decide how to act. But which computations will best inform these decisions? How long should an agent think… (more)

Subjects/Keywords: Artificial intelligence; Metalevel control; Metalevel decision-making; Metareasoning; Monte Carlo tree search; Reinforcement learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hay, N. J. (2016). Principles of Metalevel Control. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/7n35q9t1

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

Hay, Nicholas James. “Principles of Metalevel Control.” 2016. Thesis, University of California – Berkeley. Accessed October 17, 2019. http://www.escholarship.org/uc/item/7n35q9t1.

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

MLA Handbook (7th Edition):

Hay, Nicholas James. “Principles of Metalevel Control.” 2016. Web. 17 Oct 2019.

Vancouver:

Hay NJ. Principles of Metalevel Control. [Internet] [Thesis]. University of California – Berkeley; 2016. [cited 2019 Oct 17]. Available from: http://www.escholarship.org/uc/item/7n35q9t1.

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

Council of Science Editors:

Hay NJ. Principles of Metalevel Control. [Thesis]. University of California – Berkeley; 2016. Available from: http://www.escholarship.org/uc/item/7n35q9t1

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


University of Cincinnati

28. Sista, Subrahmanya Srivathsava. Adversarial Game Playing Using Monte Carlo Tree Search.

Degree: MS, Engineering and Applied Science: Computer Science, 2016, University of Cincinnati

 Monte Carlo methods are a general collection of computational algorithms that obtain results by random sampling. Monte Carlo techniques, while great for simulation, have also… (more)

Subjects/Keywords: Computer Science; monte carlo tree search; artificial intelligence; game playing; tic tac toe

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sista, S. S. (2016). Adversarial Game Playing Using Monte Carlo Tree Search. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1479820656701076

Chicago Manual of Style (16th Edition):

Sista, Subrahmanya Srivathsava. “Adversarial Game Playing Using Monte Carlo Tree Search.” 2016. Masters Thesis, University of Cincinnati. Accessed October 17, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1479820656701076.

MLA Handbook (7th Edition):

Sista, Subrahmanya Srivathsava. “Adversarial Game Playing Using Monte Carlo Tree Search.” 2016. Web. 17 Oct 2019.

Vancouver:

Sista SS. Adversarial Game Playing Using Monte Carlo Tree Search. [Internet] [Masters thesis]. University of Cincinnati; 2016. [cited 2019 Oct 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1479820656701076.

Council of Science Editors:

Sista SS. Adversarial Game Playing Using Monte Carlo Tree Search. [Masters Thesis]. University of Cincinnati; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1479820656701076


George Mason University

29. Zhou, Weiwei. Computationally Efficient Equalizer Design .

Degree: 2014, George Mason University

 Intersymbol interference (ISI) caused by frequency selective multipath propagation is a primary source of distortion in wireless communication systems. ISI significantly degrades system performance, and… (more)

Subjects/Keywords: Electrical engineering; Asymptotic efficiency; Blind sequential detection; Equalizer design; sparse ISI channel; Tree search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, W. (2014). Computationally Efficient Equalizer Design . (Thesis). George Mason University. Retrieved from http://hdl.handle.net/1920/8989

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

Chicago Manual of Style (16th Edition):

Zhou, Weiwei. “Computationally Efficient Equalizer Design .” 2014. Thesis, George Mason University. Accessed October 17, 2019. http://hdl.handle.net/1920/8989.

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

MLA Handbook (7th Edition):

Zhou, Weiwei. “Computationally Efficient Equalizer Design .” 2014. Web. 17 Oct 2019.

Vancouver:

Zhou W. Computationally Efficient Equalizer Design . [Internet] [Thesis]. George Mason University; 2014. [cited 2019 Oct 17]. Available from: http://hdl.handle.net/1920/8989.

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

Council of Science Editors:

Zhou W. Computationally Efficient Equalizer Design . [Thesis]. George Mason University; 2014. Available from: http://hdl.handle.net/1920/8989

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


North Carolina State University

30. Kulkarni, Girish. A Tabu Search Algorithm for the Steiner Tree Problem.

Degree: MS, Operations Research, 2002, North Carolina State University

 The Steiner Tree problem in graphs is an NP-hard problem having applications in many areas including telecommunication, distribution and transportation systems. We survey, briefly, a… (more)

Subjects/Keywords: Steiner Tree; Tabu Search; meta-heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kulkarni, G. (2002). A Tabu Search Algorithm for the Steiner Tree Problem. (Thesis). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/2754

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

Kulkarni, Girish. “A Tabu Search Algorithm for the Steiner Tree Problem.” 2002. Thesis, North Carolina State University. Accessed October 17, 2019. http://www.lib.ncsu.edu/resolver/1840.16/2754.

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

MLA Handbook (7th Edition):

Kulkarni, Girish. “A Tabu Search Algorithm for the Steiner Tree Problem.” 2002. Web. 17 Oct 2019.

Vancouver:

Kulkarni G. A Tabu Search Algorithm for the Steiner Tree Problem. [Internet] [Thesis]. North Carolina State University; 2002. [cited 2019 Oct 17]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2754.

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

Council of Science Editors:

Kulkarni G. A Tabu Search Algorithm for the Steiner Tree Problem. [Thesis]. North Carolina State University; 2002. Available from: http://www.lib.ncsu.edu/resolver/1840.16/2754

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

[1] [2] [3] [4] [5]

.