Search
Skip to Search Results- 2Abdi Oskouie, Mina
- 2Birkbeck, Neil Aylon Charles
- 2Cai, Zhipeng
- 2Chen, Jiyang
- 2Chowdhury, Md Solimul
- 2Chubak, Pirooz
- 74Machine Learning
- 70Reinforcement Learning
- 41Artificial Intelligence
- 36Machine learning
- 22Natural Language Processing
- 22Reinforcement learning
-
Improved approximation algorithms for Min-Max Tree Cover, Bounded Tree Cover, Shallow-Light and Buy-at-Bulk k-Steiner Tree, and (k, 2)-Subgraph
DownloadFall 2011
In this thesis we provide improved approximation algorithms for the Min-Max k-Tree Cover, Bounded Tree Cover and Shallow-Light k-Steiner Tree, (k, 2)-subgraph problems. In Chapter 2 we consider the Min-Max k -Tree Cover (MMkTC). Given a graph G = (V, E ) with weights w: E → Z+ , a set T1, T2, ......
-
Spring 2023
Pathfinding has been an interesting research area throughout the years. Heuristic search algorithms are used to find a path with the minimum length between a start and a goal in a graph, which has applications in GPS navigation and video games. There are different ways to create a heuristic for...
-
Fall 2019
Creating strong AI systems for trick-taking card games is challenging. This is mostly due to the long action sequences and extremely large information sets common in this type of game. Thus far, search-based methods have shown to be most effective in this domain. In this thesis, I explore...
-
Spring 2022
Automated Vehicle (AV) is a trending technology being developed with the promise to reduce traffic accidents caused by human errors. Perception plays a crucial role for Automated Driving Systems (ADS) to make safe decisions. However, local sensory data is insufficient to capture comprehensive...