Search
Skip to Search Results- 11074Gruhn, Dr. Ruth
- 8531Bryan, Dr. Alan L.
- 5367Hill Times Publishing
- 5206Toronto Stock Exchange
- 4502Meghan Ward
- 2546Bryan, Alan L., Dr.
- 4613Stock exchanges--Canada--Tables--Periodicals
- 4481Toronto Stock Exchange--Periodicals
- 4138lithic tools
- 3142Canada--Parliament--Periodicals
- 2027ceramics
- 1922sherd
- 34494Graduate and Postdoctoral Studies (GPS), Faculty of
- 34494Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 12938University of Alberta Libraries Licensed Resources
- 11184Anthropology, Department of
- 11157Anthropology, Department of/Bryan/Gruhn Archaeology Collection
- 4976University of Alberta Libraries Licensed Resources/Daily Record (Toronto Stock Exchange)
- 34594Thesis
- 16621Image
- 16119Report
- 4892Article (Published)
- 3506Research Material
- 1119Conference/Workshop Presentation
-
Spring 2017
Co-embedding is the process of mapping elements from multiple sets into a common latent space, which can be exploited to infer element-wise associations by considering the geometric proximity of their embeddings. Such an approach underlies the state of the art for link prediction, relation...
-
Fall 2020
For artificially intelligent learning systems to be deployed widely in real-world settings, it is important that they be able to operate decentrally. Unfortunately, decentralized control is challenging. Even finding approximately optimal joint policies of decentralized partially observable Markov...
-
1993
Lake, Robert, Schaeffer, Jonathan, Lu, Paul
Technical report TR93-13. Chess endgame databases, while of important theoretical interest, have yet to make a significant impact in tournament chess. In the game of checkers, however, endgame databases have played a pivotal role in the success of our World Championship challenger program...
-
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...
-
Solving the LP Relaxation of Distance-Constrained Vehicle Routing Problem Using Column Generation
DownloadFall 2020
The distance-constrained vehicle routing problem (DVRP) is one of the less studied variants of vehicle routing problems. Here, the objective is to deliver packages from a depot to clients with as few delivery vehicles as possible within a given time frame. In this thesis, we tackle larger...
-
Solving the radiative transfer problem in SPH simulations of contact binary mergers using FluxCal
DownloadFall 2019
V1309 Sco was observed in 2008 as a luminous red nova and presents as some of the best time-resolved spectral data of a contact binary merger. However, the parameters of its progenitor and the physics behind the morphology of its light curve remain uncertain. We use the Smoothed Particle...
-
2003
Technical report TR03-16. The Sequential Ordering Problem (SOP) is a version of the Asymmetric Traveling Salesman Problem (ATSP) where precedence constraints on the vertices must be observed. The SOP has many real life applications and it has proved to be a challenge as there are SOPs of order...