Search
Skip to Search Results- 13Graduate and Postdoctoral Studies (GPS), Faculty of
- 13Graduate and Postdoctoral Studies (GPS), Faculty of /Theses and Dissertations
- 2Biological Sciences, Department of
- 2Biological Sciences, Department of/Journal Articles (Biological Sciences)
- 1Communications and Technology Graduate Program
- 1Communications and Technology Graduate Program/Capping Projects (Communications and Technology)
-
Fall 2020
We explore the interplay of generate-and-test and gradient-descent techniques for solving online supervised learning problems. The task in supervised learning is to learn a function using samples of inputs to output pairs. This function is called the target function. The standard way to learn...
-
Fall 2011
Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. This work is based on a related work...
-
Fall 2011
In this dissertation we discuss problems of search, inference and opponent modelling in imperfect information games in the context of creating a computer player for the popular german card game skat. In so doing, we demonstrate three major contributions to the field of artificial intelligence...
-
Spring 2020
Two-Player alternate-turn perfect-information zero-sum games have been suggested as a testbed for Artificial Intelligence research since Shannon in 1950s. In this thesis, we summarize and develop algorithms for this line of research. We focus on the game of Hex — a game created by Piet Hein in...
-
Spring 2023
Cost-guided bottom-up search (BUS) algorithms use a cost function to guide the search for solving program synthesis tasks. In this thesis, we show that current state-of-the-art cost-guided BUS algorithms suffer from a common problem: they can lose useful information given by the model and fail to...
-
Spring 2012
Recent real-time heuristic search algorithms have demonstrated outstanding performance in video game pathfinding. However, their applications have been thus far limited to that domain. We proceed with the aim of facilitating wider applications of real-time search by fostering a greater...
-
Fall 2021
Heuristic search is a core area of Artificial Intelligence (AI) with numerous applications. In video games it is commonly used to calculate paths of AI-controlled agents. Traditionally, heuristic search algorithms have been designed by humans. Recent work attempted to synthesise heuristic search...
-
Spring 2015
Rayner, David Christopher Ferguson
Heuristic search is a central problem in artificial intelligence. Among its defining properties is the use of a heuristic, a scalar function mapping pairs of states to an estimate of the actual distance between them. Accurate heuristics are generally correlated with faster query resolution and...
-
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...