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

Dept: Computer Science

You searched for subject:( Heuristic). Showing records 1 – 24 of 24 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Utah

1. Chiang, Wei-Fan. Heuristics for efficient dynamic verification of message passing interface and thread programs.

Degree: MS, Computer Science, 2011, University of Utah

 Concurrent programs are extremely important for efficiently programming future HPC systems. Large scientific programs may employ multiple processes or threads to run on HPC systems… (more)

Subjects/Keywords: Dynamic verification; Heuristic; MPI programs; Thread programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiang, W. (2011). Heuristics for efficient dynamic verification of message passing interface and thread programs. (Masters Thesis). University of Utah. Retrieved from http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/405/rec/1221

Chicago Manual of Style (16th Edition):

Chiang, Wei-Fan. “Heuristics for efficient dynamic verification of message passing interface and thread programs.” 2011. Masters Thesis, University of Utah. Accessed October 22, 2019. http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/405/rec/1221.

MLA Handbook (7th Edition):

Chiang, Wei-Fan. “Heuristics for efficient dynamic verification of message passing interface and thread programs.” 2011. Web. 22 Oct 2019.

Vancouver:

Chiang W. Heuristics for efficient dynamic verification of message passing interface and thread programs. [Internet] [Masters thesis]. University of Utah; 2011. [cited 2019 Oct 22]. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/405/rec/1221.

Council of Science Editors:

Chiang W. Heuristics for efficient dynamic verification of message passing interface and thread programs. [Masters Thesis]. University of Utah; 2011. Available from: http://content.lib.utah.edu/cdm/singleitem/collection/etd3/id/405/rec/1221


University of Illinois – Urbana-Champaign

2. Ge, Victor. Solving planning problems with deep reinforcement learning and tree search.

Degree: MS, Computer Science, 2018, University of Illinois – Urbana-Champaign

 Deep reinforcement learning methods are capable of learning complex heuristics starting with no prior knowledge, but struggle in environments where the learning signal is sparse.… (more)

Subjects/Keywords: reinforcement learning; mcts; sokoban; a*; heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ge, V. (2018). Solving planning problems with deep reinforcement learning and tree search. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/101086

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

Ge, Victor. “Solving planning problems with deep reinforcement learning and tree search.” 2018. Thesis, University of Illinois – Urbana-Champaign. Accessed October 22, 2019. http://hdl.handle.net/2142/101086.

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

MLA Handbook (7th Edition):

Ge, Victor. “Solving planning problems with deep reinforcement learning and tree search.” 2018. Web. 22 Oct 2019.

Vancouver:

Ge V. Solving planning problems with deep reinforcement learning and tree search. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2018. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/2142/101086.

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

Council of Science Editors:

Ge V. Solving planning problems with deep reinforcement learning and tree search. [Thesis]. University of Illinois – Urbana-Champaign; 2018. Available from: http://hdl.handle.net/2142/101086

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

3. Kraft, Aaron R. Abstraction Hierarchies for Multi-Agent Pathfinding.

Degree: MS, Computer Science, 2017, U of Denver

  Multi-Agent Pathfinding is an NP-Complete search problem with a branching factor that is exponential in the number of agents. Because of this exponential feature,… (more)

Subjects/Keywords: Heuristic; Heuristic Search; MAPF; Multi-Agent Pathfinding; Pathfinding; Path Planning; Computer Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kraft, A. R. (2017). Abstraction Hierarchies for Multi-Agent Pathfinding. (Thesis). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1247

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

Kraft, Aaron R. “Abstraction Hierarchies for Multi-Agent Pathfinding.” 2017. Thesis, U of Denver. Accessed October 22, 2019. https://digitalcommons.du.edu/etd/1247.

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

MLA Handbook (7th Edition):

Kraft, Aaron R. “Abstraction Hierarchies for Multi-Agent Pathfinding.” 2017. Web. 22 Oct 2019.

Vancouver:

Kraft AR. Abstraction Hierarchies for Multi-Agent Pathfinding. [Internet] [Thesis]. U of Denver; 2017. [cited 2019 Oct 22]. Available from: https://digitalcommons.du.edu/etd/1247.

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

Council of Science Editors:

Kraft AR. Abstraction Hierarchies for Multi-Agent Pathfinding. [Thesis]. U of Denver; 2017. Available from: https://digitalcommons.du.edu/etd/1247

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

4. Arora, Sakshi. Heuristic and metaheuristic solutions for the bounded diameter minimum spanning tree; -.

Degree: Computer Science, 2014, Shri Mata Vaishno Devi University

avaialble

Bibliography p.184-199

Advisors/Committee Members: Garg, M L.

Subjects/Keywords: Heuristic; metaheuristic; spanning tree

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arora, S. (2014). Heuristic and metaheuristic solutions for the bounded diameter minimum spanning tree; -. (Thesis). Shri Mata Vaishno Devi University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/36688

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

Arora, Sakshi. “Heuristic and metaheuristic solutions for the bounded diameter minimum spanning tree; -.” 2014. Thesis, Shri Mata Vaishno Devi University. Accessed October 22, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/36688.

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

MLA Handbook (7th Edition):

Arora, Sakshi. “Heuristic and metaheuristic solutions for the bounded diameter minimum spanning tree; -.” 2014. Web. 22 Oct 2019.

Vancouver:

Arora S. Heuristic and metaheuristic solutions for the bounded diameter minimum spanning tree; -. [Internet] [Thesis]. Shri Mata Vaishno Devi University; 2014. [cited 2019 Oct 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/36688.

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

Council of Science Editors:

Arora S. Heuristic and metaheuristic solutions for the bounded diameter minimum spanning tree; -. [Thesis]. Shri Mata Vaishno Devi University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/36688

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


University of California – Irvine

5. Lam, William Ming. Advancing Heuristics for Search over Graphical Models.

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

 Graphical models are widely used to model complex interactions between variables. A graphical model contains many functions over these variables which have an underlying graph… (more)

Subjects/Keywords: Artificial intelligence; combinatorial optimization; graphical models; heuristic search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lam, W. M. (2017). Advancing Heuristics for Search over Graphical Models. (Thesis). University of California – Irvine. Retrieved from http://www.escholarship.org/uc/item/3kf999mp

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

Lam, William Ming. “Advancing Heuristics for Search over Graphical Models.” 2017. Thesis, University of California – Irvine. Accessed October 22, 2019. http://www.escholarship.org/uc/item/3kf999mp.

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

MLA Handbook (7th Edition):

Lam, William Ming. “Advancing Heuristics for Search over Graphical Models.” 2017. Web. 22 Oct 2019.

Vancouver:

Lam WM. Advancing Heuristics for Search over Graphical Models. [Internet] [Thesis]. University of California – Irvine; 2017. [cited 2019 Oct 22]. Available from: http://www.escholarship.org/uc/item/3kf999mp.

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

Council of Science Editors:

Lam WM. Advancing Heuristics for Search over Graphical Models. [Thesis]. University of California – Irvine; 2017. Available from: http://www.escholarship.org/uc/item/3kf999mp

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


UCLA

6. 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 October 22, 2019. 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. 22 Oct 2019.

Vancouver:

Chen Y. Learning Bayesian Network Structures with Non-Decomposable Scores. [Internet] [Thesis]. UCLA; 2016. [cited 2019 Oct 22]. 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


UCLA

7. 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 October 22, 2019. 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. 22 Oct 2019.

Vancouver:

Barker JK. Front-To-End Bidirectional Heuristic Search. [Internet] [Thesis]. UCLA; 2015. [cited 2019 Oct 22]. 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 Southern California

8. 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 October 22, 2019. 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. 22 Oct 2019.

Vancouver:

Sun X. Incremental search-based path planning for moving target search. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2019 Oct 22]. 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 Southern California

9. 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 October 22, 2019. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/83772/rec/847.

MLA Handbook (7th Edition):

Nash, Alex. “Any-angle path planning.” 2012. Web. 22 Oct 2019.

Vancouver:

Nash A. Any-angle path planning. [Internet] [Doctoral dissertation]. University of Southern California; 2012. [cited 2019 Oct 22]. 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


University of Georgia

10. Chen, Jianxia. Towards advanced event monitoring services on decentralized and delay tolerant networks.

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

 Event monitoring services are rapidly gaining importance in many application domains ranging from real time monitoring systems in production, logistics and networking to complex event… (more)

Subjects/Keywords: Event Monitoring; Event Aggregation; Redundancy Elimination; Complex Event Detection; Delay Tolerant Network; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, J. (2011). Towards advanced event monitoring services on decentralized and delay tolerant networks. (Doctoral Dissertation). University of Georgia. Retrieved from http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd

Chicago Manual of Style (16th Edition):

Chen, Jianxia. “Towards advanced event monitoring services on decentralized and delay tolerant networks.” 2011. Doctoral Dissertation, University of Georgia. Accessed October 22, 2019. http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd.

MLA Handbook (7th Edition):

Chen, Jianxia. “Towards advanced event monitoring services on decentralized and delay tolerant networks.” 2011. Web. 22 Oct 2019.

Vancouver:

Chen J. Towards advanced event monitoring services on decentralized and delay tolerant networks. [Internet] [Doctoral dissertation]. University of Georgia; 2011. [cited 2019 Oct 22]. Available from: http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd.

Council of Science Editors:

Chen J. Towards advanced event monitoring services on decentralized and delay tolerant networks. [Doctoral Dissertation]. University of Georgia; 2011. Available from: http://purl.galileo.usg.edu/uga_etd/chen_jianxia_201108_phd


University of Windsor

11. KHODA, MD MAHBUB-E. Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks.

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

 Optical data centers consume a large quantity of energy and the cost of that energy has a significant contribution to the operational cost in data… (more)

Subjects/Keywords: Electricity Cost; Energy Efficient; Heuristic; Optical Data Center Network; Real Time; Routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

KHODA, M. M. (2018). Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/7532

Chicago Manual of Style (16th Edition):

KHODA, MD MAHBUB-E. “Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks.” 2018. Masters Thesis, University of Windsor. Accessed October 22, 2019. https://scholar.uwindsor.ca/etd/7532.

MLA Handbook (7th Edition):

KHODA, MD MAHBUB-E. “Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks.” 2018. Web. 22 Oct 2019.

Vancouver:

KHODA MM. Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks. [Internet] [Masters thesis]. University of Windsor; 2018. [cited 2019 Oct 22]. Available from: https://scholar.uwindsor.ca/etd/7532.

Council of Science Editors:

KHODA MM. Heuristic for Lowering Electricity Costs for Routing in Optical Data Center Networks. [Masters Thesis]. University of Windsor; 2018. Available from: https://scholar.uwindsor.ca/etd/7532


Rutgers University

12. Imielinska, Celina Z. A general class of heuristics for constrained forest and cycle problems.

Degree: PhD, Computer Science, 1993, Rutgers University

Let G = (V, E) be a connected, undirected, edge-weighted graph. A subgraph of G satisfying a certain criteria will be called an optimal solution… (more)

Subjects/Keywords: Heuristic algorithms; Traveling-salesman problem; Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Imielinska, C. Z. (1993). A general class of heuristics for constrained forest and cycle problems. (Doctoral Dissertation). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/52073/

Chicago Manual of Style (16th Edition):

Imielinska, Celina Z. “A general class of heuristics for constrained forest and cycle problems.” 1993. Doctoral Dissertation, Rutgers University. Accessed October 22, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/52073/.

MLA Handbook (7th Edition):

Imielinska, Celina Z. “A general class of heuristics for constrained forest and cycle problems.” 1993. Web. 22 Oct 2019.

Vancouver:

Imielinska CZ. A general class of heuristics for constrained forest and cycle problems. [Internet] [Doctoral dissertation]. Rutgers University; 1993. [cited 2019 Oct 22]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52073/.

Council of Science Editors:

Imielinska CZ. A general class of heuristics for constrained forest and cycle problems. [Doctoral Dissertation]. Rutgers University; 1993. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/52073/

13. Yohan, P M. Heuristic based multi token proper name identification and classification for telugu text documents; -.

Degree: Computer Science, 2013, Acharya Nagarjuna University

Abstract available

References 107-122

Advisors/Committee Members: Govardhan, A.

Subjects/Keywords: Heuristic; Natural Language Processing; Telugu Morphology; Transliteration

Page 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yohan, P. M. (2013). Heuristic based multi token proper name identification and classification for telugu text documents; -. (Thesis). Acharya Nagarjuna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/30635

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

Yohan, P M. “Heuristic based multi token proper name identification and classification for telugu text documents; -.” 2013. Thesis, Acharya Nagarjuna University. Accessed October 22, 2019. http://shodhganga.inflibnet.ac.in/handle/10603/30635.

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

MLA Handbook (7th Edition):

Yohan, P M. “Heuristic based multi token proper name identification and classification for telugu text documents; -.” 2013. Web. 22 Oct 2019.

Vancouver:

Yohan PM. Heuristic based multi token proper name identification and classification for telugu text documents; -. [Internet] [Thesis]. Acharya Nagarjuna University; 2013. [cited 2019 Oct 22]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/30635.

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

Council of Science Editors:

Yohan PM. Heuristic based multi token proper name identification and classification for telugu text documents; -. [Thesis]. Acharya Nagarjuna University; 2013. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/30635

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

14. Jochumsson, Thorvaldur. Heuristic multi-sequence search methods.

Degree: Computer Science, 2001, University of Skövde

  With increasing size of sequence databases heuristic search approaches have become necessary. Hidden Markov models are the best performing search methods known today with… (more)

Subjects/Keywords: Heuristic multi-sequence search methods; Computer Sciences; Datavetenskap (datalogi)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jochumsson, T. (2001). Heuristic multi-sequence search methods. (Thesis). University of Skövde. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-530

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

Jochumsson, Thorvaldur. “Heuristic multi-sequence search methods.” 2001. Thesis, University of Skövde. Accessed October 22, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-530.

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

MLA Handbook (7th Edition):

Jochumsson, Thorvaldur. “Heuristic multi-sequence search methods.” 2001. Web. 22 Oct 2019.

Vancouver:

Jochumsson T. Heuristic multi-sequence search methods. [Internet] [Thesis]. University of Skövde; 2001. [cited 2019 Oct 22]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-530.

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

Council of Science Editors:

Jochumsson T. Heuristic multi-sequence search methods. [Thesis]. University of Skövde; 2001. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-530

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


UCLA

15. Schreiber, Ethan L. Optimal Multi-Way Number Partitioning.

Degree: Computer Science, 2014, UCLA

 The NP-hard number-partitioning problem is to separate a multiset S ofn positive integers into k subsets, such that the largest sum of theintegers assigned to… (more)

Subjects/Keywords: Computer science; Artificial intelligence; Artificial Intelligence; Combinatorial Optimization; Constraint Satisfaction; Heuristic Search; NP-Complete; Number Partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schreiber, E. L. (2014). Optimal Multi-Way Number Partitioning. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/30g6n09q

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

Schreiber, Ethan L. “Optimal Multi-Way Number Partitioning.” 2014. Thesis, UCLA. Accessed October 22, 2019. http://www.escholarship.org/uc/item/30g6n09q.

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

MLA Handbook (7th Edition):

Schreiber, Ethan L. “Optimal Multi-Way Number Partitioning.” 2014. Web. 22 Oct 2019.

Vancouver:

Schreiber EL. Optimal Multi-Way Number Partitioning. [Internet] [Thesis]. UCLA; 2014. [cited 2019 Oct 22]. Available from: http://www.escholarship.org/uc/item/30g6n09q.

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

Council of Science Editors:

Schreiber EL. Optimal Multi-Way Number Partitioning. [Thesis]. UCLA; 2014. Available from: http://www.escholarship.org/uc/item/30g6n09q

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


Virginia Tech

16. Swartz, Kent Olen. Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics.

Degree: MS, Computer Science, 2003, Virginia Tech

  Developing economical yet effective methods of incorporating usability engineering as an integral part of software engineering is a primary focus of human-computer interaction (HCI)… (more)

Subjects/Keywords: Formative Evaluation; Virtual Environments; Heuristic Evaluation; Usability Engineering Methodology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Swartz, K. O. (2003). Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/34890

Chicago Manual of Style (16th Edition):

Swartz, Kent Olen. “Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics.” 2003. Masters Thesis, Virginia Tech. Accessed October 22, 2019. http://hdl.handle.net/10919/34890.

MLA Handbook (7th Edition):

Swartz, Kent Olen. “Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics.” 2003. Web. 22 Oct 2019.

Vancouver:

Swartz KO. Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics. [Internet] [Masters thesis]. Virginia Tech; 2003. [cited 2019 Oct 22]. Available from: http://hdl.handle.net/10919/34890.

Council of Science Editors:

Swartz KO. Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics. [Masters Thesis]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/34890


Mississippi State University

17. Zhou, Rong. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.

Degree: PhD, Computer Science, 2005, Mississippi State University

 Graph search is used in many areas of computer science. It is well-known that the scalability of graph-search algorithms such as A* is limited by… (more)

Subjects/Keywords: heuristic search; external-memory graph search; memory-based heuristics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, R. (2005). Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;

Chicago Manual of Style (16th Edition):

Zhou, Rong. “Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.” 2005. Doctoral Dissertation, Mississippi State University. Accessed October 22, 2019. http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;.

MLA Handbook (7th Edition):

Zhou, Rong. “Memory-Efficient Graph Search Applied to Multiple Sequence Alignment.” 2005. Web. 22 Oct 2019.

Vancouver:

Zhou R. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. [Internet] [Doctoral dissertation]. Mississippi State University; 2005. [cited 2019 Oct 22]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;.

Council of Science Editors:

Zhou R. Memory-Efficient Graph Search Applied to Multiple Sequence Alignment. [Doctoral Dissertation]. Mississippi State University; 2005. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-06282005-015428/ ;


San Jose State University

18. Murli, Kaushik. Assessing Code Obfuscation of Metamorphic JavaScript.

Degree: MS, Computer Science, 2019, San Jose State University

  Metamorphic malware is one of the biggest and most ubiquitous threats in the digital world. It can be used to morph the structure of… (more)

Subjects/Keywords: Metamorphic malware; Signature detection; Heuristic anal- ysis; Support Vector Machines; Artificial Intelligence and Robotics; Information Security

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Murli, K. (2019). Assessing Code Obfuscation of Metamorphic JavaScript. (Masters Thesis). San Jose State University. Retrieved from https://doi.org/10.31979/etd.c2cn-mpyd ; https://scholarworks.sjsu.edu/etd_projects/667

Chicago Manual of Style (16th Edition):

Murli, Kaushik. “Assessing Code Obfuscation of Metamorphic JavaScript.” 2019. Masters Thesis, San Jose State University. Accessed October 22, 2019. https://doi.org/10.31979/etd.c2cn-mpyd ; https://scholarworks.sjsu.edu/etd_projects/667.

MLA Handbook (7th Edition):

Murli, Kaushik. “Assessing Code Obfuscation of Metamorphic JavaScript.” 2019. Web. 22 Oct 2019.

Vancouver:

Murli K. Assessing Code Obfuscation of Metamorphic JavaScript. [Internet] [Masters thesis]. San Jose State University; 2019. [cited 2019 Oct 22]. Available from: https://doi.org/10.31979/etd.c2cn-mpyd ; https://scholarworks.sjsu.edu/etd_projects/667.

Council of Science Editors:

Murli K. Assessing Code Obfuscation of Metamorphic JavaScript. [Masters Thesis]. San Jose State University; 2019. Available from: https://doi.org/10.31979/etd.c2cn-mpyd ; https://scholarworks.sjsu.edu/etd_projects/667


Missouri University of Science and Technology

19. Ravichandran, Lokesh Krishna. Search-based model summarization.

Degree: M.S. in Computer Science, Computer Science, Missouri University of Science and Technology

 "Large systems are complex and consist of numerous components and interactions between the components. Hence managing such large systems is a cumbersome and time consuming… (more)

Subjects/Keywords: Heuristic Search; Model Summary; Search Based Software Engineering; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ravichandran, L. K. (n.d.). Search-based model summarization. (Masters Thesis). Missouri University of Science and Technology. Retrieved from http://scholarsmine.mst.edu/masters_theses/5391

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Chicago Manual of Style (16th Edition):

Ravichandran, Lokesh Krishna. “Search-based model summarization.” Masters Thesis, Missouri University of Science and Technology. Accessed October 22, 2019. http://scholarsmine.mst.edu/masters_theses/5391.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

MLA Handbook (7th Edition):

Ravichandran, Lokesh Krishna. “Search-based model summarization.” Web. 22 Oct 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Ravichandran LK. Search-based model summarization. [Internet] [Masters thesis]. Missouri University of Science and Technology; [cited 2019 Oct 22]. Available from: http://scholarsmine.mst.edu/masters_theses/5391.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Council of Science Editors:

Ravichandran LK. Search-based model summarization. [Masters Thesis]. Missouri University of Science and Technology; Available from: http://scholarsmine.mst.edu/masters_theses/5391

Note: this citation may be lacking information needed for this citation format:
No year of publication.


Georgia State University

20. Wang, Hsiu-Chung. Toward a Heuristic Model for Evaluating the Complexity of Computer Security Visualization Interface.

Degree: MS, Computer Science, 2006, Georgia State University

 Computer security visualization has gained much attention in the research community in the past few years. However, the advancement in security visualization research has been… (more)

Subjects/Keywords: Security visualization; Heuristic evaluation; Classification; Evaluation method; Metrics; Cognitive psychology; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (2006). Toward a Heuristic Model for Evaluating the Complexity of Computer Security Visualization Interface. (Thesis). Georgia State University. Retrieved from https://scholarworks.gsu.edu/cs_theses/35

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, Hsiu-Chung. “Toward a Heuristic Model for Evaluating the Complexity of Computer Security Visualization Interface.” 2006. Thesis, Georgia State University. Accessed October 22, 2019. https://scholarworks.gsu.edu/cs_theses/35.

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

MLA Handbook (7th Edition):

Wang, Hsiu-Chung. “Toward a Heuristic Model for Evaluating the Complexity of Computer Security Visualization Interface.” 2006. Web. 22 Oct 2019.

Vancouver:

Wang H. Toward a Heuristic Model for Evaluating the Complexity of Computer Security Visualization Interface. [Internet] [Thesis]. Georgia State University; 2006. [cited 2019 Oct 22]. Available from: https://scholarworks.gsu.edu/cs_theses/35.

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

Council of Science Editors:

Wang H. Toward a Heuristic Model for Evaluating the Complexity of Computer Security Visualization Interface. [Thesis]. Georgia State University; 2006. Available from: https://scholarworks.gsu.edu/cs_theses/35

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

21. Duwal Shrestha, Mahendra. Efficient Simulation Of A Simple Evolutionary System.

Degree: MS, Computer Science, 2017, University of Tennessee – Knoxville

  An infinite population model is considered for diploid evolution under the influence of crossing over and mutation. The evolution equations show how Vose’s haploid… (more)

Subjects/Keywords: evolutionary system; genetic algotithm; walsh transform; random heuristic search; periodic orbits; oscillation; Numerical Analysis and Scientific Computing; Other Computer Sciences; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Duwal Shrestha, M. (2017). Efficient Simulation Of A Simple Evolutionary System. (Thesis). University of Tennessee – Knoxville. Retrieved from https://trace.tennessee.edu/utk_gradthes/4735

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

Duwal Shrestha, Mahendra. “Efficient Simulation Of A Simple Evolutionary System.” 2017. Thesis, University of Tennessee – Knoxville. Accessed October 22, 2019. https://trace.tennessee.edu/utk_gradthes/4735.

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

MLA Handbook (7th Edition):

Duwal Shrestha, Mahendra. “Efficient Simulation Of A Simple Evolutionary System.” 2017. Web. 22 Oct 2019.

Vancouver:

Duwal Shrestha M. Efficient Simulation Of A Simple Evolutionary System. [Internet] [Thesis]. University of Tennessee – Knoxville; 2017. [cited 2019 Oct 22]. Available from: https://trace.tennessee.edu/utk_gradthes/4735.

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

Council of Science Editors:

Duwal Shrestha M. Efficient Simulation Of A Simple Evolutionary System. [Thesis]. University of Tennessee – Knoxville; 2017. Available from: https://trace.tennessee.edu/utk_gradthes/4735

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


Vanderbilt University

22. White, Christopher Jules. Optimizing the Configuration of Software Product Line Variants.

Degree: PhD, Computer Science, 2008, Vanderbilt University

 Software Product-Lines (SPLs) are software architectures that provide reusable components that can be configured into variants to meet different requirement sets. A key part of… (more)

Subjects/Keywords: software product-lines; heuristic algorithms; constraint satisfaction problems; constraint programming; configuration; optimization; Software product line engineering; Constraint programming (Computer science)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

White, C. J. (2008). Optimizing the Configuration of Software Product Line Variants. (Doctoral Dissertation). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;

Chicago Manual of Style (16th Edition):

White, Christopher Jules. “Optimizing the Configuration of Software Product Line Variants.” 2008. Doctoral Dissertation, Vanderbilt University. Accessed October 22, 2019. http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;.

MLA Handbook (7th Edition):

White, Christopher Jules. “Optimizing the Configuration of Software Product Line Variants.” 2008. Web. 22 Oct 2019.

Vancouver:

White CJ. Optimizing the Configuration of Software Product Line Variants. [Internet] [Doctoral dissertation]. Vanderbilt University; 2008. [cited 2019 Oct 22]. Available from: http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;.

Council of Science Editors:

White CJ. Optimizing the Configuration of Software Product Line Variants. [Doctoral Dissertation]. Vanderbilt University; 2008. Available from: http://etd.library.vanderbilt.edu/available/etd-11052008-174438/ ;

23. Moore, Justin. Transit Search.

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

  Pathfinding is an area of research and of practical importance in Computer Science. The A* algorithm is well known as a pathfinding algorithm that… (more)

Subjects/Keywords: Communication and the arts; Applied sciences; A*; Heuristic; Pathfinding; Region; Search; Transit

…13 4 Naive Maximum Allowed Heuristic Preparation… …start node of a search problem h(a,b) A heuristic estimate of the shortest path’s… …current point in the search h(n) A heuristic estimate of the shortest path cost from n… …range [0,∞) h*(a,b) A perfect heuristic estimate of the cost from nodes a… …to b h*(n) A perfect heuristic estimate of the cost from n to the goal state p c… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moore, J. (2014). Transit Search. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5109

Chicago Manual of Style (16th Edition):

Moore, Justin. “Transit Search.” 2014. Masters Thesis, University of Windsor. Accessed October 22, 2019. https://scholar.uwindsor.ca/etd/5109.

MLA Handbook (7th Edition):

Moore, Justin. “Transit Search.” 2014. Web. 22 Oct 2019.

Vancouver:

Moore J. Transit Search. [Internet] [Masters thesis]. University of Windsor; 2014. [cited 2019 Oct 22]. Available from: https://scholar.uwindsor.ca/etd/5109.

Council of Science Editors:

Moore J. Transit Search. [Masters Thesis]. University of Windsor; 2014. Available from: https://scholar.uwindsor.ca/etd/5109

24. Simpkins, Bryan Glen. Optimal Vector Packing in Multiple Dimensions with Heuristic Search.

Degree: Computer Science, 2012, UCLA

 We study an extension of the well-known bin-packing problem to multiple dimensions, resulting in the "vector packing" problem. The problem is to find the minimum… (more)

Subjects/Keywords: Computer science; Bin Packing; Heuristic Search; Optimal Vector Bin Packing; Server Migration; Vector Bin Packing; Vector Packing

…x5D; created the one-dimensional version of the heuristic used in this thesis and is… …Heuristics Another notion that can be used to aid any search algorithm is that of a heuristic… …context of vector packing, a heuristic estimates how many additional bins must be added to pack… …all the remaining items. A heuristic is said to be admissible if and only if the estimate is… …a strict lower bound on the remaining cost of any solution. Put another way, a heuristic… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simpkins, B. G. (2012). Optimal Vector Packing in Multiple Dimensions with Heuristic Search. (Thesis). UCLA. Retrieved from http://www.escholarship.org/uc/item/81c613js

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

Simpkins, Bryan Glen. “Optimal Vector Packing in Multiple Dimensions with Heuristic Search.” 2012. Thesis, UCLA. Accessed October 22, 2019. http://www.escholarship.org/uc/item/81c613js.

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

MLA Handbook (7th Edition):

Simpkins, Bryan Glen. “Optimal Vector Packing in Multiple Dimensions with Heuristic Search.” 2012. Web. 22 Oct 2019.

Vancouver:

Simpkins BG. Optimal Vector Packing in Multiple Dimensions with Heuristic Search. [Internet] [Thesis]. UCLA; 2012. [cited 2019 Oct 22]. Available from: http://www.escholarship.org/uc/item/81c613js.

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

Council of Science Editors:

Simpkins BG. Optimal Vector Packing in Multiple Dimensions with Heuristic Search. [Thesis]. UCLA; 2012. Available from: http://www.escholarship.org/uc/item/81c613js

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

.