This decommissioned ERA site remains active temporarily to support our final migration steps to https://ualberta.scholaris.ca, ERA's new home. All new collections and items, including Spring 2025 theses, are at that site. For assistance, please contact erahelp@ualberta.ca.
Search
Skip to Search Results- 2Glaser, Vern
- 1Arndt, D.
- 1Atwood, Gordon Harold.
- 1Berjanskii, M.
- 1Cockcroft, Daniel
- 1El Rayyes, Luai I.
- 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)
- 2Toolkit for Grant Success
- 2Toolkit for Grant Success/Successful Grants (Toolkit for Grant Success)
-
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...