Search
Skip to Search Results- 84Artificial Intelligence
- 23Machine Learning
- 14Computing Science
- 10Reinforcement Learning
- 8Planning
- 7Computer Games
- 4Müller, Martin
- 3Mueller, Martin
- 3Schaeffer, Jonathan
- 2Dr. Carrie Demmans Epp
- 2Johanson, Michael
- 2Lin, Guohui
- 50Graduate and Postdoctoral Studies (GPS), Faculty of
- 50Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 19Computing Science, Department of
- 18Computing Science, Department of/Technical Reports (Computing Science)
- 8WISEST Summer Research Program
- 8WISEST Summer Research Program/WISEST Research Posters
-
Fall 2019
Improvisation is a form of live theatre where artists perform real-time, dynamic problem solving to collaboratively generate interesting narratives. The main contribution of this thesis is the development of artificial improvisation: improvised theatre performed by humans alongside intelligent...
-
Fall 2017
Modern board, card, and video games are challenging domains for AI research due to their complex game mechanics and large state and action spaces. For instance, in Hearthstone — a popular collectible card (CC) (video) game developed by Blizzard Entertainment — two players first construct their...
-
Spring 2019
Current state-of-the-art algorithms for trick-taking card games use a process called determinization. Determinization is a technique that allows the application of perfect information state evaluation algorithms to imperfect information games. It involves a two-step process in which a perfect...
-
2010
Mueller, Martin, Hoffman, Joerg, Nakhost, Hootan
Technical report TR10-02. A ubiquitous feature of planning problems -- problems involving the automatic generation of action sequences for attaining a given goal -- is the need to economize limited resources such as fuel or money. While heuristic search, mostly based on standard algorithms such...
-
Interrelating Prediction and Control Objectives in Episodic Actor-Critic Reinforcement Learning
DownloadFall 2020
The reinforcement learning framework provides a simple way to study computational intelligence as the interaction between an agent and an environment. The goal of an agent is to accrue as much reward as possible by intelligently choosing actions given states. This problem of finding a policy that...
-
Spring 2010
The Monte-Carlo Tree Search (MCTS) algorithm Upper Confidence bounds applied to Trees (UCT) has become extremely popular in computer games research. Because of the importance of this family of algorithms, a deeper understanding of when and how their different enhancements work is desirable. To...
-
Fall 2015
Artificial Intelligence (AI) techniques have been widely used in video games to control non-playable characters. More recently, AI has been applied to automated story generation with the objective of managing the player’s experience in an interactive narrative. Such AI experience managers can...
-
Fall 2020
Word sense disambiguation (WSD) is one of the core tasks in natural language processing and its objective is to identify the sense of a content word (nouns, verbs, adjectives, and adverbs) in context, given a predefined sense inventory. Although WSD is a monolingual task, it has been conjectured...
-
Spring 2023
With machine learning models becoming more complicated and more widely applied to solve real-world challenges, there comes the need to explain their reasoning. In parallel with the advancements of deep learning methods, Explainable AI (XAI) algorithms have been proposed to address the issue of...
-
1992
Technical report TR92-19. In August 1992, the first man versus machine world championship took place. The champion, Dr. Marion Tinsley, is arguably the greatest checkers player that ever lived. The challenger was the computer checkers program Chinook, a 3 year team effort from the University of...