Search
Skip to Search Results- 14Graduate and Postdoctoral Studies (GPS), Faculty of
- 14Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 6WISEST Summer Research Program
- 6WISEST Summer Research Program/WISEST Research Posters
- 2Toolkit for Grant Success
- 2Toolkit for Grant Success/Educational Materials (Toolkit for Grant Success)
-
2010
Carbonaro, Mike, Cutumisu, Maria, Schaeffer, Jonathan, Szafron, Duane
Enrollment in Computing Science university programs is at a dangerously low level. A major reason for this is the general lack of interest in Computing Science by females. In this paper, we discuss our experience with using a computer game construction environment as a vehicle to encourage female...
-
Fall 2010
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 given weak heuristic h{0} and a set of unlabeled training instances using a bootstrapping procedure. The training instances that can be...
-
Fall 2013
Many important problems can be cast as state-space problems. In this dissertation we study a general paradigm for solving state-space problems which we name Cluster-and-Conquer (C&C). Algorithms that follow the C&C paradigm use the concept of equivalent states to reduce the number of states...
-
Fall 2013
This thesis introduces random walk (RW) planning as a new search paradigm for satisficing planning by studying its theory, its practical relevance, and applications. We develop a theoretical framework that explains the strengths and weaknesses of random walks as a tool for heuristic search....
-
2014
Burch, Neil, Holte, Robert, Arneson, Broderick
This manual describes PSVN, a language for describing state space search problems using multi-valued variables that lends itself to efficient calculation of state's successors and predecessors without having to fully ground the operators. It also describes the PSVN compiler, psvn2c, which accepts...
-
Fall 2014
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 solution, these are often not feasible given practical resource requirements. In such cases, it is necessary to sacrifice solution...
-
Spring 2016
This thesis proposes, analyzes and tests different exploration-based techniques in Greedy Best-First Search (GBFS) for satisficing planning. First, we show the potential of exploration-based techniques by combining GBFS and random walk exploration locally. We then conduct deep analysis on how...