Search
Skip to Search Results- 85Artificial Intelligence
- 22Machine Learning
- 21Game theory
- 10Computer Games
- 10Reinforcement Learning
- 8Planning
- 4Müller, Martin
- 3Bowling, Michael
- 3Johanson, Michael
- 3Lanctot, Marc
- 3Mueller, Martin
- 3Zinkevich, Martin
- 65Graduate and Postdoctoral Studies (GPS), Faculty of
- 65Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 21Computing Science, Department of
- 21Computing Science, Department of/Technical Reports (Computing Science)
- 4Toolkit for Grant Success
- 4WISEST Summer Research Program
-
2013
Valenzano, Richard, Müller, Martin, Xie, Fan
Most of the satisficing planners which are based on heuristic search iteratively improve their solution quality through an anytime approach. Typically, the lowest-cost solution found so far is used to constrain the search. This avoids areas of the state space which cannot directly lead to lower...
-
2023-10-13
The slides accompany a ChatGPT workshop that is intended for university students to learn more about generative AI and in the context of ChatGPT. This work is licensed under a Creative Commons license so that others may share and adapt the content for other purposes as long as appropriate credit...
-
Fall 2009
Answer typing is an important aspect of the question answering process. Most commonly addressed with the use of a fixed set of possible answer classes via question classification, answer typing influences which answers will ultimately be selected as correct. Answer typing introduces the concept...
-
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...
-
Spring 2023
There has been a renewed interest in commonsense as a stepping stone toward achieving human-level intelligence. By digesting enormous amounts of data in different forms, such as visual, lingual, and sensory, humans are able to create a world model for themselves. It is hypothesized that this...
-
Spring 2016
Algorithmic decipherment is a prime example of a truly unsupervised problem. This thesis presents several algorithms developed for the purpose of decrypting unknown alphabetic scripts representing unknown languages. We assume that symbols in scripts which contain no more than a few dozen unique...
-
Continuous-time Repeated Games with Imperfect Information: Folk Theorems and Explicit Results
DownloadSpring 2016
This thesis treats continuous-time models of repeated interactions with imperfect public monitoring. In such models, players do not directly observe each other's actions and instead see only the impacts of the chosen actions on the distribution of a random signal. Often, there are two reasons why...
-
Cooperative linear precoding for spectrum sharing in multi-user wireless systems: game theoretic approach
DownloadFall 2009
Future wireless communications expect to experience a spectrum shortage problem. One practical solution is spectrum sharing. This thesis studies precoding strategies to allocate communication resources for spectrum sharing in multi-user wireless systems from a game-theoretic perspective. The...
-
Fall 2010
Multicast is a bandwidth efficient mechanism to provide wireless services for a group of nodes. Providing reliable wireless multicast is challenging due to channel fading. This thesis investigates cooperation among receiving nodes to enhance the reliability of wireless multicast. A time division...