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

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


University of Georgia

1. Deng, Rucen. Spray treatment planning using the ant system Metaheuristic.

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

 The spray treatment planning project is designed to assist the pesticide management programs as a computerized decision support system for optimizing spray routes. This optimization… (more)

Subjects/Keywords: Heuristic Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deng, R. (2006). Spray treatment planning using the ant system Metaheuristic. (Masters Thesis). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/deng_rucen_200608_ms

Chicago Manual of Style (16th Edition):

Deng, Rucen. “Spray treatment planning using the ant system Metaheuristic.” 2006. Masters Thesis, University of Georgia. Accessed March 29, 2020. http://purl.galileo.usg.edu/uga_etd/deng_rucen_200608_ms.

MLA Handbook (7th Edition):

Deng, Rucen. “Spray treatment planning using the ant system Metaheuristic.” 2006. Web. 29 Mar 2020.

Vancouver:

Deng R. Spray treatment planning using the ant system Metaheuristic. [Internet] [Masters thesis]. University of Georgia; 2006. [cited 2020 Mar 29]. Available from: http://purl.galileo.usg.edu/uga_etd/deng_rucen_200608_ms.

Council of Science Editors:

Deng R. Spray treatment planning using the ant system Metaheuristic. [Masters Thesis]. University of Georgia; 2006. Available from: http://purl.galileo.usg.edu/uga_etd/deng_rucen_200608_ms


University of Alberta

2. Huntley, Daniel A. Performance Analysis of Real-time Heuristic Search Through Search Space Characterization.

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

 Recent real-time heuristic search algorithms have demonstrated outstanding performance in video game pathfinding. However, their applications have been thus far limited to that domain. We… (more)

Subjects/Keywords: Real-time; Search; Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huntley, D. A. (2012). Performance Analysis of Real-time Heuristic Search Through Search Space Characterization. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/n009w2828

Chicago Manual of Style (16th Edition):

Huntley, Daniel A. “Performance Analysis of Real-time Heuristic Search Through Search Space Characterization.” 2012. Masters Thesis, University of Alberta. Accessed March 29, 2020. https://era.library.ualberta.ca/files/n009w2828.

MLA Handbook (7th Edition):

Huntley, Daniel A. “Performance Analysis of Real-time Heuristic Search Through Search Space Characterization.” 2012. Web. 29 Mar 2020.

Vancouver:

Huntley DA. Performance Analysis of Real-time Heuristic Search Through Search Space Characterization. [Internet] [Masters thesis]. University of Alberta; 2012. [cited 2020 Mar 29]. Available from: https://era.library.ualberta.ca/files/n009w2828.

Council of Science Editors:

Huntley DA. Performance Analysis of Real-time Heuristic Search Through Search Space Characterization. [Masters Thesis]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/n009w2828


University of Alberta

3. Pang, Bo. Multimapping Abstraction and State-set Search Theory.

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

 This thesis consists of two parts. First, we invented an abstraction framework called multimapping which allows multiple admissible heuristic values to be extracted from one… (more)

Subjects/Keywords: state-set; abstraction; heuristic search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pang, B. (2012). Multimapping Abstraction and State-set Search Theory. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/xs55mc798

Chicago Manual of Style (16th Edition):

Pang, Bo. “Multimapping Abstraction and State-set Search Theory.” 2012. Masters Thesis, University of Alberta. Accessed March 29, 2020. https://era.library.ualberta.ca/files/xs55mc798.

MLA Handbook (7th Edition):

Pang, Bo. “Multimapping Abstraction and State-set Search Theory.” 2012. Web. 29 Mar 2020.

Vancouver:

Pang B. Multimapping Abstraction and State-set Search Theory. [Internet] [Masters thesis]. University of Alberta; 2012. [cited 2020 Mar 29]. Available from: https://era.library.ualberta.ca/files/xs55mc798.

Council of Science Editors:

Pang B. Multimapping Abstraction and State-set Search Theory. [Masters Thesis]. University of Alberta; 2012. Available from: https://era.library.ualberta.ca/files/xs55mc798


University of Alberta

4. Yang, Fan. Additive abstraction-based heuristics.

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

 In this thesis, we study theoretically and empirically the additive abstraction-based heuristics. First we present formal general definitions for abstractions that extend to general additive… (more)

Subjects/Keywords: heuristic search; additive; heuristics; abstraction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, F. (2011). Additive abstraction-based heuristics. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/fx719m90m

Chicago Manual of Style (16th Edition):

Yang, Fan. “Additive abstraction-based heuristics.” 2011. Doctoral Dissertation, University of Alberta. Accessed March 29, 2020. https://era.library.ualberta.ca/files/fx719m90m.

MLA Handbook (7th Edition):

Yang, Fan. “Additive abstraction-based heuristics.” 2011. Web. 29 Mar 2020.

Vancouver:

Yang F. Additive abstraction-based heuristics. [Internet] [Doctoral dissertation]. University of Alberta; 2011. [cited 2020 Mar 29]. Available from: https://era.library.ualberta.ca/files/fx719m90m.

Council of Science Editors:

Yang F. Additive abstraction-based heuristics. [Doctoral Dissertation]. University of Alberta; 2011. Available from: https://era.library.ualberta.ca/files/fx719m90m


University of Hong Kong

5. Lam, Yun-sang, Albert. Theory of optimization and a novel chemical reaction-inspired metaheuristic.

Degree: PhD, 2009, University of Hong Kong

published_or_final_version

Electrical and Electronic Engineering

Doctoral

Doctor of Philosophy

Advisors/Committee Members: Li, VOK.

Subjects/Keywords: Search theory.; Mathematical optimization.; Heuristic.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lam, Yun-sang, A. (2009). Theory of optimization and a novel chemical reaction-inspired metaheuristic. (Doctoral Dissertation). University of Hong Kong. Retrieved from Lam, Y. A. [林潤生]. (2009). Theory of optimization and a novel chemical reaction-inspired metaheuristic. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4322412 ; http://dx.doi.org/10.5353/th_b4322412 ; http://hdl.handle.net/10722/56802

Chicago Manual of Style (16th Edition):

Lam, Yun-sang, Albert. “Theory of optimization and a novel chemical reaction-inspired metaheuristic.” 2009. Doctoral Dissertation, University of Hong Kong. Accessed March 29, 2020. Lam, Y. A. [林潤生]. (2009). Theory of optimization and a novel chemical reaction-inspired metaheuristic. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4322412 ; http://dx.doi.org/10.5353/th_b4322412 ; http://hdl.handle.net/10722/56802.

MLA Handbook (7th Edition):

Lam, Yun-sang, Albert. “Theory of optimization and a novel chemical reaction-inspired metaheuristic.” 2009. Web. 29 Mar 2020.

Vancouver:

Lam, Yun-sang A. Theory of optimization and a novel chemical reaction-inspired metaheuristic. [Internet] [Doctoral dissertation]. University of Hong Kong; 2009. [cited 2020 Mar 29]. Available from: Lam, Y. A. [林潤生]. (2009). Theory of optimization and a novel chemical reaction-inspired metaheuristic. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4322412 ; http://dx.doi.org/10.5353/th_b4322412 ; http://hdl.handle.net/10722/56802.

Council of Science Editors:

Lam, Yun-sang A. Theory of optimization and a novel chemical reaction-inspired metaheuristic. [Doctoral Dissertation]. University of Hong Kong; 2009. Available from: Lam, Y. A. [林潤生]. (2009). Theory of optimization and a novel chemical reaction-inspired metaheuristic. (Thesis). University of Hong Kong, Pokfulam, Hong Kong SAR. Retrieved from http://dx.doi.org/10.5353/th_b4322412 ; http://dx.doi.org/10.5353/th_b4322412 ; http://hdl.handle.net/10722/56802


University of Alberta

6. Furtak, Timothy M. Symmetries and Search in Trick-Taking Card Games.

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

 In this dissertation we consider the problem of cardplay move evaluation in the context of trick-taking card games, specifically the German card game Skat, and… (more)

Subjects/Keywords: card games; heuristic search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Furtak, T. M. (2013). Symmetries and Search in Trick-Taking Card Games. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/hm50ts89k

Chicago Manual of Style (16th Edition):

Furtak, Timothy M. “Symmetries and Search in Trick-Taking Card Games.” 2013. Doctoral Dissertation, University of Alberta. Accessed March 29, 2020. https://era.library.ualberta.ca/files/hm50ts89k.

MLA Handbook (7th Edition):

Furtak, Timothy M. “Symmetries and Search in Trick-Taking Card Games.” 2013. Web. 29 Mar 2020.

Vancouver:

Furtak TM. Symmetries and Search in Trick-Taking Card Games. [Internet] [Doctoral dissertation]. University of Alberta; 2013. [cited 2020 Mar 29]. Available from: https://era.library.ualberta.ca/files/hm50ts89k.

Council of Science Editors:

Furtak TM. Symmetries and Search in Trick-Taking Card Games. [Doctoral Dissertation]. University of Alberta; 2013. Available from: https://era.library.ualberta.ca/files/hm50ts89k


University of Edinburgh

7. Crosby, Matthew David. Multiagent classical planning.

Degree: PhD, 2014, University of Edinburgh

 Classical planning problems consist of an environment in a predefined state; a set of deterministic actions that, under certain conditions, change the state of the… (more)

Subjects/Keywords: 006.3; multiagent planning; heuristic search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Crosby, M. D. (2014). Multiagent classical planning. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/8853

Chicago Manual of Style (16th Edition):

Crosby, Matthew David. “Multiagent classical planning.” 2014. Doctoral Dissertation, University of Edinburgh. Accessed March 29, 2020. http://hdl.handle.net/1842/8853.

MLA Handbook (7th Edition):

Crosby, Matthew David. “Multiagent classical planning.” 2014. Web. 29 Mar 2020.

Vancouver:

Crosby MD. Multiagent classical planning. [Internet] [Doctoral dissertation]. University of Edinburgh; 2014. [cited 2020 Mar 29]. Available from: http://hdl.handle.net/1842/8853.

Council of Science Editors:

Crosby MD. Multiagent classical planning. [Doctoral Dissertation]. University of Edinburgh; 2014. Available from: http://hdl.handle.net/1842/8853


Anna University

8. Manavalasundaram V K. Efficient scheduling in decentralized grid environment;.

Degree: Efficient scheduling in decentralized grid environment, 2014, Anna University

The grid computing enables wide area resource sharing and collaboration It is a fast emerging distributed technology Based on scheduling of computational jobs for different… (more)

Subjects/Keywords: Grid computing; Heuristic Local Search; Heuristic Simulated Annealing; Heuristic Tabu Search; Information and communication engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

K, M. V. (2014). Efficient scheduling in decentralized grid environment;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22911

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

K, Manavalasundaram V. “Efficient scheduling in decentralized grid environment;.” 2014. Thesis, Anna University. Accessed March 29, 2020. http://shodhganga.inflibnet.ac.in/handle/10603/22911.

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

MLA Handbook (7th Edition):

K, Manavalasundaram V. “Efficient scheduling in decentralized grid environment;.” 2014. Web. 29 Mar 2020.

Vancouver:

K MV. Efficient scheduling in decentralized grid environment;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Mar 29]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22911.

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

Council of Science Editors:

K MV. Efficient scheduling in decentralized grid environment;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22911

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


University of Southern California

9. Sun, Xiaoxun. Incremental search-based path planning for moving target search.

Degree: PhD, Computer Science, 2013, University of Southern California

 In this dissertation, I demonstrate how to speed up path planning for moving target search, which is a problem where an agent needs to move… (more)

Subjects/Keywords: artificial intelligence; search; heuristic search; moving target search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sun, X. (2013). Incremental search-based path planning for moving target search. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/236875/rec/3456

Chicago Manual of Style (16th Edition):

Sun, Xiaoxun. “Incremental search-based path planning for moving target search.” 2013. Doctoral Dissertation, University of Southern California. Accessed March 29, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/236875/rec/3456.

MLA Handbook (7th Edition):

Sun, Xiaoxun. “Incremental search-based path planning for moving target search.” 2013. Web. 29 Mar 2020.

Vancouver:

Sun X. Incremental search-based path planning for moving target search. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2020 Mar 29]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/236875/rec/3456.

Council of Science Editors:

Sun X. Incremental search-based path planning for moving target search. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/236875/rec/3456


University of Alberta

10. Valenzano, Richard Anthony. Design Decisions in Suboptimal Heuristic Search-Based Systems.

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

Heuristic search has been shown to be an effective way to solve state-space problems. While many heuristic search techniques are guaranteed to find the best… (more)

Subjects/Keywords: Computing Science; Heuristic Search; Artificial Intelligence

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Valenzano, R. A. (2014). Design Decisions in Suboptimal Heuristic Search-Based Systems. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/qf85nc095

Chicago Manual of Style (16th Edition):

Valenzano, Richard Anthony. “Design Decisions in Suboptimal Heuristic Search-Based Systems.” 2014. Doctoral Dissertation, University of Alberta. Accessed March 29, 2020. https://era.library.ualberta.ca/files/qf85nc095.

MLA Handbook (7th Edition):

Valenzano, Richard Anthony. “Design Decisions in Suboptimal Heuristic Search-Based Systems.” 2014. Web. 29 Mar 2020.

Vancouver:

Valenzano RA. Design Decisions in Suboptimal Heuristic Search-Based Systems. [Internet] [Doctoral dissertation]. University of Alberta; 2014. [cited 2020 Mar 29]. Available from: https://era.library.ualberta.ca/files/qf85nc095.

Council of Science Editors:

Valenzano RA. Design Decisions in Suboptimal Heuristic Search-Based Systems. [Doctoral Dissertation]. University of Alberta; 2014. Available from: https://era.library.ualberta.ca/files/qf85nc095


University of Alberta

11. Jabbari Arfaee, Shahab. Bootstrap Learning of Heuristic Functions.

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

 We investigate the use of machine learning to create effective heuristics for single-agent search. Our method aims to generate a sequence of heuristics from a… (more)

Subjects/Keywords: Learning Heuristics; Bootstrapping; Heuristic Search; Planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jabbari Arfaee, S. (2010). Bootstrap Learning of Heuristic Functions. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/p2676w277

Chicago Manual of Style (16th Edition):

Jabbari Arfaee, Shahab. “Bootstrap Learning of Heuristic Functions.” 2010. Masters Thesis, University of Alberta. Accessed March 29, 2020. https://era.library.ualberta.ca/files/p2676w277.

MLA Handbook (7th Edition):

Jabbari Arfaee, Shahab. “Bootstrap Learning of Heuristic Functions.” 2010. Web. 29 Mar 2020.

Vancouver:

Jabbari Arfaee S. Bootstrap Learning of Heuristic Functions. [Internet] [Masters thesis]. University of Alberta; 2010. [cited 2020 Mar 29]. Available from: https://era.library.ualberta.ca/files/p2676w277.

Council of Science Editors:

Jabbari Arfaee S. Bootstrap Learning of Heuristic Functions. [Masters Thesis]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/p2676w277


Virginia Tech

12. Neas, Charles Bennett. A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles.

Degree: MS, Aerospace and Ocean Engineering, 2010, Virginia Tech

 This thesis presents a greedy search algorithm for maneuver-based motion planning of agile vehicles. In maneuver-based motion planning, vehicle maneuvers are solved offline and saved… (more)

Subjects/Keywords: Motion Primitives; A*; Motion Planning; Heuristic Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neas, C. B. (2010). A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36213

Chicago Manual of Style (16th Edition):

Neas, Charles Bennett. “A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles.” 2010. Masters Thesis, Virginia Tech. Accessed March 29, 2020. http://hdl.handle.net/10919/36213.

MLA Handbook (7th Edition):

Neas, Charles Bennett. “A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles.” 2010. Web. 29 Mar 2020.

Vancouver:

Neas CB. A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles. [Internet] [Masters thesis]. Virginia Tech; 2010. [cited 2020 Mar 29]. Available from: http://hdl.handle.net/10919/36213.

Council of Science Editors:

Neas CB. A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles. [Masters Thesis]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/36213


Delft University of Technology

13. Vasilikos, V. Heuristic Search for Defect Tolerant Multiprocessor Arrays:.

Degree: 2011, Delft University of Technology

 In this paper, new heuristic-search methods and algorithms are presented for enabling highly efficient and adaptive, defect-tolerant multiprocessor arrays. We consider systems where a homogeneous… (more)

Subjects/Keywords: heuristic search; fault tolerance; multiprocessor array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vasilikos, V. (2011). Heuristic Search for Defect Tolerant Multiprocessor Arrays:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6bd8fee2-806b-4a95-ac66-056348f8c36c

Chicago Manual of Style (16th Edition):

Vasilikos, V. “Heuristic Search for Defect Tolerant Multiprocessor Arrays:.” 2011. Masters Thesis, Delft University of Technology. Accessed March 29, 2020. http://resolver.tudelft.nl/uuid:6bd8fee2-806b-4a95-ac66-056348f8c36c.

MLA Handbook (7th Edition):

Vasilikos, V. “Heuristic Search for Defect Tolerant Multiprocessor Arrays:.” 2011. Web. 29 Mar 2020.

Vancouver:

Vasilikos V. Heuristic Search for Defect Tolerant Multiprocessor Arrays:. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2020 Mar 29]. Available from: http://resolver.tudelft.nl/uuid:6bd8fee2-806b-4a95-ac66-056348f8c36c.

Council of Science Editors:

Vasilikos V. Heuristic Search for Defect Tolerant Multiprocessor Arrays:. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:6bd8fee2-806b-4a95-ac66-056348f8c36c


Mississippi State University

14. Malone, Brandon. Learning optimal Bayesian networks with heuristic search.

Degree: PhD, Computer Science and Engineering, 2012, Mississippi State University

  Bayesian networks are a widely used graphical model which formalize reasoning under uncertainty. Unfortunately, construction of a Bayesian network by an expert is timeconsuming,… (more)

Subjects/Keywords: machine learning; heuristic search; Bayesian networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Malone, B. (2012). Learning optimal Bayesian networks with heuristic search. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06202012-144942/ ;

Chicago Manual of Style (16th Edition):

Malone, Brandon. “Learning optimal Bayesian networks with heuristic search.” 2012. Doctoral Dissertation, Mississippi State University. Accessed March 29, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06202012-144942/ ;.

MLA Handbook (7th Edition):

Malone, Brandon. “Learning optimal Bayesian networks with heuristic search.” 2012. Web. 29 Mar 2020.

Vancouver:

Malone B. Learning optimal Bayesian networks with heuristic search. [Internet] [Doctoral dissertation]. Mississippi State University; 2012. [cited 2020 Mar 29]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06202012-144942/ ;.

Council of Science Editors:

Malone B. Learning optimal Bayesian networks with heuristic search. [Doctoral Dissertation]. Mississippi State University; 2012. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06202012-144942/ ;


UCLA

15. Barker, Joseph Kelly. Front-To-End Bidirectional Heuristic Search.

Degree: Computer Science, 2015, UCLA

 Bidirectional heuristic search is a well-known technique for solving pathfinding problems. The goal in a pathfinding problem is to find paths – often of lowest cost –… (more)

Subjects/Keywords: Computer science; Artificial intelligence; Artificial Intelligence; Bidirectional Search; Heuristic Search; Pathfinding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barker, J. K. (2015). Front-To-End Bidirectional Heuristic Search. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/5j34j5bj

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

Barker, Joseph Kelly. “Front-To-End Bidirectional Heuristic Search.” 2015. Thesis, UCLA. Accessed March 29, 2020. http://www.escholarship.org/uc/item/5j34j5bj.

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

MLA Handbook (7th Edition):

Barker, Joseph Kelly. “Front-To-End Bidirectional Heuristic Search.” 2015. Web. 29 Mar 2020.

Vancouver:

Barker JK. Front-To-End Bidirectional Heuristic Search. [Internet] [Thesis]. UCLA; 2015. [cited 2020 Mar 29]. Available from: http://www.escholarship.org/uc/item/5j34j5bj.

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

Council of Science Editors:

Barker JK. Front-To-End Bidirectional Heuristic Search. [Thesis]. UCLA; 2015. Available from: http://www.escholarship.org/uc/item/5j34j5bj

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


University of Alberta

16. Valenzano, Richard. Simultaneously searching with multiple algorithm settings: an alternative to parameter tuning for suboptimal single-agent search.

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

 Many single-agent search algorithms have parameters that need to be tuned. Although settings found by offline tuning will exhibit strong average performance, properly selecting parameter… (more)

Subjects/Keywords: parallel search; WIDA*; dovetailing; WA*; suboptimal single-agent search; WRBFS; parameter tuning; heuristic search; BULB

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Valenzano, R. (2009). Simultaneously searching with multiple algorithm settings: an alternative to parameter tuning for suboptimal single-agent search. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cv43nx96m

Chicago Manual of Style (16th Edition):

Valenzano, Richard. “Simultaneously searching with multiple algorithm settings: an alternative to parameter tuning for suboptimal single-agent search.” 2009. Masters Thesis, University of Alberta. Accessed March 29, 2020. https://era.library.ualberta.ca/files/cv43nx96m.

MLA Handbook (7th Edition):

Valenzano, Richard. “Simultaneously searching with multiple algorithm settings: an alternative to parameter tuning for suboptimal single-agent search.” 2009. Web. 29 Mar 2020.

Vancouver:

Valenzano R. Simultaneously searching with multiple algorithm settings: an alternative to parameter tuning for suboptimal single-agent search. [Internet] [Masters thesis]. University of Alberta; 2009. [cited 2020 Mar 29]. Available from: https://era.library.ualberta.ca/files/cv43nx96m.

Council of Science Editors:

Valenzano R. Simultaneously searching with multiple algorithm settings: an alternative to parameter tuning for suboptimal single-agent search. [Masters Thesis]. University of Alberta; 2009. Available from: https://era.library.ualberta.ca/files/cv43nx96m


University of Toronto

17. Gammell, Jonathan David. Informed Anytime Search for Continuous Planning Problems.

Degree: PhD, 2017, University of Toronto

 Navigating uncontrolled dynamic environments is a major challenge in robotics. Success requires solving many different technical problems and path planning is a key component of… (more)

Subjects/Keywords: Anytime Search; Heuristic Search; Informed Search; Optimal Planning; Path Planning; Sampling-based Planning; 0771

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gammell, J. D. (2017). Informed Anytime Search for Continuous Planning Problems. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/78630

Chicago Manual of Style (16th Edition):

Gammell, Jonathan David. “Informed Anytime Search for Continuous Planning Problems.” 2017. Doctoral Dissertation, University of Toronto. Accessed March 29, 2020. http://hdl.handle.net/1807/78630.

MLA Handbook (7th Edition):

Gammell, Jonathan David. “Informed Anytime Search for Continuous Planning Problems.” 2017. Web. 29 Mar 2020.

Vancouver:

Gammell JD. Informed Anytime Search for Continuous Planning Problems. [Internet] [Doctoral dissertation]. University of Toronto; 2017. [cited 2020 Mar 29]. Available from: http://hdl.handle.net/1807/78630.

Council of Science Editors:

Gammell JD. Informed Anytime Search for Continuous Planning Problems. [Doctoral Dissertation]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/78630


Queensland University of Technology

18. Mousavi Nogholi, Amin Alah. Optimisation of open pit mine block sequencing.

Degree: 2015, Queensland University of Technology

 This study presents a comprehensive mathematical model for open pit mine block sequencing problem which considers technical aspects of real-life mine operations. As the open… (more)

Subjects/Keywords: Mining; Block Sequencing; Open Pit; Optimisation; Simulated Annealing; Tabu Search; Hybrid Heuristic; Local Search; Stockpile; Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mousavi Nogholi, A. A. (2015). Optimisation of open pit mine block sequencing. (Thesis). Queensland University of Technology. Retrieved from https://eprints.qut.edu.au/86697/

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

Mousavi Nogholi, Amin Alah. “Optimisation of open pit mine block sequencing.” 2015. Thesis, Queensland University of Technology. Accessed March 29, 2020. https://eprints.qut.edu.au/86697/.

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

MLA Handbook (7th Edition):

Mousavi Nogholi, Amin Alah. “Optimisation of open pit mine block sequencing.” 2015. Web. 29 Mar 2020.

Vancouver:

Mousavi Nogholi AA. Optimisation of open pit mine block sequencing. [Internet] [Thesis]. Queensland University of Technology; 2015. [cited 2020 Mar 29]. Available from: https://eprints.qut.edu.au/86697/.

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

Council of Science Editors:

Mousavi Nogholi AA. Optimisation of open pit mine block sequencing. [Thesis]. Queensland University of Technology; 2015. Available from: https://eprints.qut.edu.au/86697/

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

19. Jesus Filho, José Eurípedes Ferreira de. Método beam search aplicado ao problema de escalonamento de tarefas flexível.

Degree: Mestrado, Ciência da Computação, 2013, University of São Paulo

O Job Shop Scheduling Problem é um problema NP-Difícil que chama a atenção de muitos pesquisadores devido seu desafio matemático e sua aplicabilidade em contextos… (more)

Subjects/Keywords: Beam Search; Beam Search; escalonamento; heuristic method; Job Shop; Job Shop; método heurístico; schedule.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jesus Filho, J. E. F. d. (2013). Método beam search aplicado ao problema de escalonamento de tarefas flexível. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/45/45134/tde-07082013-145142/ ;

Chicago Manual of Style (16th Edition):

Jesus Filho, José Eurípedes Ferreira de. “Método beam search aplicado ao problema de escalonamento de tarefas flexível.” 2013. Masters Thesis, University of São Paulo. Accessed March 29, 2020. http://www.teses.usp.br/teses/disponiveis/45/45134/tde-07082013-145142/ ;.

MLA Handbook (7th Edition):

Jesus Filho, José Eurípedes Ferreira de. “Método beam search aplicado ao problema de escalonamento de tarefas flexível.” 2013. Web. 29 Mar 2020.

Vancouver:

Jesus Filho JEFd. Método beam search aplicado ao problema de escalonamento de tarefas flexível. [Internet] [Masters thesis]. University of São Paulo; 2013. [cited 2020 Mar 29]. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-07082013-145142/ ;.

Council of Science Editors:

Jesus Filho JEFd. Método beam search aplicado ao problema de escalonamento de tarefas flexível. [Masters Thesis]. University of São Paulo; 2013. Available from: http://www.teses.usp.br/teses/disponiveis/45/45134/tde-07082013-145142/ ;


University of Alberta

20. 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 March 29, 2020. https://era.library.ualberta.ca/files/cft848q99j.

MLA Handbook (7th Edition):

Churchill, David G. “Heuristic Search Techniques for Real-Time Strategy Games.” 2016. Web. 29 Mar 2020.

Vancouver:

Churchill DG. Heuristic Search Techniques for Real-Time Strategy Games. [Internet] [Doctoral dissertation]. University of Alberta; 2016. [cited 2020 Mar 29]. 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 Pennsylvania

21. Cohen, Benjamin. Motion Planning for Manipulation With Heuristic Search.

Degree: 2015, University of Pennsylvania

Heuristic searches such as A* search are a popular means of finding least-cost plans due to their generality, strong theoretical guarantees on completeness and optimality,… (more)

Subjects/Keywords: heuristic search; manipulation; motion planning; path planning; robot arm; search-based planning; Computer Sciences; Robotics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cohen, B. (2015). Motion Planning for Manipulation With Heuristic Search. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/1663

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

Cohen, Benjamin. “Motion Planning for Manipulation With Heuristic Search.” 2015. Thesis, University of Pennsylvania. Accessed March 29, 2020. https://repository.upenn.edu/edissertations/1663.

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

MLA Handbook (7th Edition):

Cohen, Benjamin. “Motion Planning for Manipulation With Heuristic Search.” 2015. Web. 29 Mar 2020.

Vancouver:

Cohen B. Motion Planning for Manipulation With Heuristic Search. [Internet] [Thesis]. University of Pennsylvania; 2015. [cited 2020 Mar 29]. Available from: https://repository.upenn.edu/edissertations/1663.

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

Council of Science Editors:

Cohen B. Motion Planning for Manipulation With Heuristic Search. [Thesis]. University of Pennsylvania; 2015. Available from: https://repository.upenn.edu/edissertations/1663

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


Linköping University

22. Hölscher, Anton. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem.

Degree: Artificial Intelligence and Integrated Computer Systems, 2018, Linköping University

  This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to… (more)

Subjects/Keywords: weighted k-chinese postman problem heuristic tabu search metaheuristic tabu search; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hölscher, A. (2018). A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem. (Thesis). Linköping University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631

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

Hölscher, Anton. “A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem.” 2018. Thesis, Linköping University. Accessed March 29, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631.

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

MLA Handbook (7th Edition):

Hölscher, Anton. “A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem.” 2018. Web. 29 Mar 2020.

Vancouver:

Hölscher A. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem. [Internet] [Thesis]. Linköping University; 2018. [cited 2020 Mar 29]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631.

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

Council of Science Editors:

Hölscher A. A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem. [Thesis]. Linköping University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631

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

23. Mehler, Tilman. Challenges and applications of assembly level software model checking.

Degree: 2006, Technische Universität Dortmund

 This thesis addresses the application of a formal method called Model Checking to the domain of software verification. Here, exploration algorithms are used to search(more)

Subjects/Keywords: Heuristic search; Software model checking; State space reduction; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mehler, T. (2006). Challenges and applications of assembly level software model checking. (Thesis). Technische Universität Dortmund. Retrieved from http://hdl.handle.net/2003/22435

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

Mehler, Tilman. “Challenges and applications of assembly level software model checking.” 2006. Thesis, Technische Universität Dortmund. Accessed March 29, 2020. http://hdl.handle.net/2003/22435.

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

MLA Handbook (7th Edition):

Mehler, Tilman. “Challenges and applications of assembly level software model checking.” 2006. Web. 29 Mar 2020.

Vancouver:

Mehler T. Challenges and applications of assembly level software model checking. [Internet] [Thesis]. Technische Universität Dortmund; 2006. [cited 2020 Mar 29]. Available from: http://hdl.handle.net/2003/22435.

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

Council of Science Editors:

Mehler T. Challenges and applications of assembly level software model checking. [Thesis]. Technische Universität Dortmund; 2006. Available from: http://hdl.handle.net/2003/22435

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


Brunel University

24. Woodside-Oriakhi, Maria. Portfolio optimisation with transaction cost.

Degree: PhD, 2011, Brunel University

 Portfolio selection is an example of decision making under conditions of uncertainty. In the face of an unknown future, fund managers make complex financial choices… (more)

Subjects/Keywords: Heuristic algorithms; Genetic algorithm; Tabu search; Simulated anealing; Optimal solutions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Woodside-Oriakhi, M. (2011). Portfolio optimisation with transaction cost. (Doctoral Dissertation). Brunel University. Retrieved from http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924

Chicago Manual of Style (16th Edition):

Woodside-Oriakhi, Maria. “Portfolio optimisation with transaction cost.” 2011. Doctoral Dissertation, Brunel University. Accessed March 29, 2020. http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924.

MLA Handbook (7th Edition):

Woodside-Oriakhi, Maria. “Portfolio optimisation with transaction cost.” 2011. Web. 29 Mar 2020.

Vancouver:

Woodside-Oriakhi M. Portfolio optimisation with transaction cost. [Internet] [Doctoral dissertation]. Brunel University; 2011. [cited 2020 Mar 29]. Available from: http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924.

Council of Science Editors:

Woodside-Oriakhi M. Portfolio optimisation with transaction cost. [Doctoral Dissertation]. Brunel University; 2011. Available from: http://bura.brunel.ac.uk/handle/2438/5839 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539924


University of Alberta

25. 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 March 29, 2020. 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. 29 Mar 2020.

Vancouver:

Farajmandi M. MODULES MULTI-LIFT PLANNING ON INDUSTRIAL SITE: DEVELOPMENTS OF DECISION SUPPORT TOOLS. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2020 Mar 29]. 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


University of Southern California

26. Nash, Alex. Any-angle path planning.

Degree: PhD, Computer Science, 2012, University of Southern California

 Navigating an agent from a given start coordinate to a given goal coordinate through a continuous environment is one of the most important problems faced… (more)

Subjects/Keywords: path planning; any-angle; robotics; heuristic search; artificial intelligence; video games

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nash, A. (2012). Any-angle path planning. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/83772/rec/847

Chicago Manual of Style (16th Edition):

Nash, Alex. “Any-angle path planning.” 2012. Doctoral Dissertation, University of Southern California. Accessed March 29, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/83772/rec/847.

MLA Handbook (7th Edition):

Nash, Alex. “Any-angle path planning.” 2012. Web. 29 Mar 2020.

Vancouver:

Nash A. Any-angle path planning. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2020 Mar 29]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/83772/rec/847.

Council of Science Editors:

Nash A. Any-angle path planning. [Doctoral Dissertation]. University of Southern California; 2012. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/83772/rec/847


UCLA

27. Chen, Yuh-Jie. Learning Bayesian Network Structures with Non-Decomposable Scores.

Degree: Computer Science, 2016, UCLA

 Bayesian networks learned from data and background knowledge have been broadly used to reason under uncertainty, and to determine associations and dependencies between random variables… (more)

Subjects/Keywords: Artificial intelligence; Computer science; Bayesian networks; heuristic search; structure learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, Y. (2016). Learning Bayesian Network Structures with Non-Decomposable Scores. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/7r51b4hv

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

Chen, Yuh-Jie. “Learning Bayesian Network Structures with Non-Decomposable Scores.” 2016. Thesis, UCLA. Accessed March 29, 2020. http://www.escholarship.org/uc/item/7r51b4hv.

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

MLA Handbook (7th Edition):

Chen, Yuh-Jie. “Learning Bayesian Network Structures with Non-Decomposable Scores.” 2016. Web. 29 Mar 2020.

Vancouver:

Chen Y. Learning Bayesian Network Structures with Non-Decomposable Scores. [Internet] [Thesis]. UCLA; 2016. [cited 2020 Mar 29]. Available from: http://www.escholarship.org/uc/item/7r51b4hv.

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

Council of Science Editors:

Chen Y. Learning Bayesian Network Structures with Non-Decomposable Scores. [Thesis]. UCLA; 2016. Available from: http://www.escholarship.org/uc/item/7r51b4hv

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


Delft University of Technology

28. Geerlings, A.C. Adaptive tracking in seismic exploration.

Degree: 1990, Delft University of Technology

Subjects/Keywords: seismology; heuristic search; pattern recognition

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Geerlings, A. C. (1990). Adaptive tracking in seismic exploration. (Doctoral Dissertation). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16

Chicago Manual of Style (16th Edition):

Geerlings, A C. “Adaptive tracking in seismic exploration.” 1990. Doctoral Dissertation, Delft University of Technology. Accessed March 29, 2020. http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16.

MLA Handbook (7th Edition):

Geerlings, A C. “Adaptive tracking in seismic exploration.” 1990. Web. 29 Mar 2020.

Vancouver:

Geerlings AC. Adaptive tracking in seismic exploration. [Internet] [Doctoral dissertation]. Delft University of Technology; 1990. [cited 2020 Mar 29]. Available from: http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16.

Council of Science Editors:

Geerlings AC. Adaptive tracking in seismic exploration. [Doctoral Dissertation]. Delft University of Technology; 1990. Available from: http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; urn:NBN:nl:ui:24-uuid:b959853f-cc34-43e7-add2-8e2c68620e16 ; http://resolver.tudelft.nl/uuid:b959853f-cc34-43e7-add2-8e2c68620e16


Universitat Politècnica de València

29. Torreño Lerma, Alejandro. Cooperative planning in multi-agent systems .

Degree: 2016, Universitat Politècnica de València

 [EN] Automated planning is a centralized process in which a single planning entity, or agent, synthesizes a course of action, or plan, that satisfies a… (more)

Subjects/Keywords: Multi-Agent Planning; Multi-Heuristic Search; Distributed Heuristics; Privacy-Preserving Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Torreño Lerma, A. (2016). Cooperative planning in multi-agent systems . (Doctoral Dissertation). Universitat Politècnica de València. Retrieved from http://hdl.handle.net/10251/65815

Chicago Manual of Style (16th Edition):

Torreño Lerma, Alejandro. “Cooperative planning in multi-agent systems .” 2016. Doctoral Dissertation, Universitat Politècnica de València. Accessed March 29, 2020. http://hdl.handle.net/10251/65815.

MLA Handbook (7th Edition):

Torreño Lerma, Alejandro. “Cooperative planning in multi-agent systems .” 2016. Web. 29 Mar 2020.

Vancouver:

Torreño Lerma A. Cooperative planning in multi-agent systems . [Internet] [Doctoral dissertation]. Universitat Politècnica de València; 2016. [cited 2020 Mar 29]. Available from: http://hdl.handle.net/10251/65815.

Council of Science Editors:

Torreño Lerma A. Cooperative planning in multi-agent systems . [Doctoral Dissertation]. Universitat Politècnica de València; 2016. Available from: http://hdl.handle.net/10251/65815


University of Saskatchewan

30. Nunez Siri, Jorge Dionisio 1994-. AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations.

Degree: 2019, University of Saskatchewan

 We apply Simulated Annealing, a well-known metaheuristic for obtaining near-optimal solutions to optimization problems, to discover conserved synteny relations (similar features) in genomes. The analysis… (more)

Subjects/Keywords: synteny; comparative-genomics; simulated-annealing; heuristic-search; javascript; d3-visualization; circos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Nunez Siri, J. D. 1. (2019). AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/12368

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

Nunez Siri, Jorge Dionisio 1994-. “AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations.” 2019. Thesis, University of Saskatchewan. Accessed March 29, 2020. http://hdl.handle.net/10388/12368.

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

MLA Handbook (7th Edition):

Nunez Siri, Jorge Dionisio 1994-. “AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations.” 2019. Web. 29 Mar 2020.

Vancouver:

Nunez Siri JD1. AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations. [Internet] [Thesis]. University of Saskatchewan; 2019. [cited 2020 Mar 29]. Available from: http://hdl.handle.net/10388/12368.

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

Council of Science Editors:

Nunez Siri JD1. AccuSyn: Using Simulated Annealing to Declutter Genome Visualizations. [Thesis]. University of Saskatchewan; 2019. Available from: http://hdl.handle.net/10388/12368

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

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

.