Search
Skip to Search Results- 14Szafron, Duane (Computing Science)
- 8Holte, Robert (Computing Science)
- 1Amaral, José Nelson (Computing Science)
- 1Culberson, Joseph (Computing Science)
- 1Greiner, Russell (Computing Science)
- 1Müller, Martin (Computing Science)
-
Action Selection for Hammer Shots in Curling: Optimization of Non-convex Continuous Actions With Stochastic Action Outcomes
DownloadSpring 2017
Optimal decision making in the face of uncertainty is an active area of research in artificial intelligence. In this thesis, I present the sport of curling as a novel application domain for research in optimal decision making. I focus on one aspect of the sport, the hammer shot, the last shot...
-
Spring 2011
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 abstractions. We show that the general definition makes proofs of admissibility, consistency, and...
-
Fall 2009
Most story-based games today have manually-scripted non-player characters (NPCs) and the scripts are usually simple and repetitive since it is time-consuming for game developers to script each character individually. ScriptEase, a publicly-available author-oriented developer tool, attempts to...
-
Applying support vector machines to discover just-in-time method-specific compilation strategies
DownloadFall 2010
Adaptive Just-in-Time compilers employ multiple techniques to concentrate compilation efforts in the most promising spots of the application, balancing tight compilation budgets with an appropriate level of code quality. Some compiler researchers propose that Just-in-Time compilers should...
-
Fall 2014
An agent in an adversarial, imperfect information environment must sometimes decide whether or not to take an action and, if they take the action, must choose a parameter value associated with that action. Examples include choosing to buy or sell some amount of resources or choosing whether or...
-
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 2011
Scripting languages have gained popularity in video games for specifying the interactive content in a story. Game designers do not necessarily possess programming skills and often demand code-generating tools that can transform textual or graphical descriptions of interactions into scripts...
-
Spring 2015
Believable, realistic video game character behaviour continues to lag behind the improvements in graphics, stories and game play in video games. In this dissertation we focus on the use of two techniques, emotional gaits and emotional incidents, as a way to add easily identifiable, non-verbal,...
-
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...
-
Fall 2010
Non-Player Character (NPC) behaviors in today’s computer games are mostly generated from manually written scripts. The high cost of manually creating complex behaviors for each NPC to exhibit intelligence in response to every situation in the game results in NPCs with repetitive and artificial...