Search
Skip to Search Results- 1Arndt, D.
- 1Atwood, Gordon Harold.
- 1Berjanskii, M.
- 1Cockcroft, Daniel
- 1El Rayyes, Luai I.
- 1Erland, Broghan
- 25Graduate and Postdoctoral Studies (GPS), Faculty of
- 25Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 3Computing Science, Department of
- 3Computing Science, Department of/Technical Reports (Computing Science)
- 1Biological Sciences, Department of
- 1Biological Sciences, Department of/Journal Articles (Biological Sciences)
-
Fall 2023
We consider stochastic generalized linear bandit (GLB) problems when the reward distributions are log-concave and subgaussian. We consider for this problem the perturbed history exploration (PHE) algorithmIn each round of its operation, PHE perturbs the observed rewards by adding fresh noise to...
-
Fall 2010
The game of Hex is of interest to the mathematics, algorithms, and artificial intelligence communities. It is a classical PSPACE-complete problem, and its invention is intrinsically tied to the Four Colour Theorem and the well-known strategy-stealing argument. Nash, Shannon, Tarjan, and Berge are...
-
1994
Schaeffer, Jonathan, Pijls, Wim, Plaat, Aske, de Bruin, Arie
Technical report TR94-17. In 1979 Stockman introduced the SSS* minimax search algorithm that dominates Alpha-Beta in the number of leaf nodes expanded. Further investigation of the algorithm showed that it had three serious drawbacks, which prevented its use by practitioners: it is difficult to...
-
2019-10-01
SSHRC IG awarded 2020: the goal of this project is to uncover the work and decisions involved in collecting, organizing, and changing the data used by algorithms, using business ethnographic methodology. This understanding is ultimately critical to revealing how algorithms work, and to revealing...