Search
Skip to Search Results- 4Müller, Martin
- 3Mueller, Martin
- 2Johanson, Michael
- 2Nakhost, Hootan
- 2Schaeffer, Jonathan
- 2Valenzano, Richard
-
2021-07-10
Adams, Cathy, Lemermeyer, Gilllian
The Alberta Teachers’ Association (ATA), the Kule Institute for Advanced Study (KIAS) and the Faculty of Education, University of Alberta engaged in a partnership to organize a research and policy scoping initiative that would report on the expected impact of artificial intelligence (AI) in...
-
2019-02-09
Lund, Tyler and Safouhi, Hassan
Technology is ubiquitous and powerful in its effects. Despite the fact that many technologies follow a predictable exponential growth rate, due to our lack of exponential intuition, we often have the impression that technology appears unexpectedly. We term this subset of technology as exponential...
-
2013
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...
-
2013-02-26
In the field of computational game theory, games are often compared in terms of their size. This can be measured in several ways, including the number of unique game states, the number of decision points, and the total number of legal actions over all decision points. These numbers are either...
-
2013
Sturtevant, Nathan R., Valenzano, Richard, Schaeffer, Jonathan
While greedy best-first search (GBFS) is a popular algorithm for solving automated planning tasks, it can exhibit poor performance if the heuristic in use mistakenly identifies a region of the search space as promising. In such cases, the way the algorithm greedily trusts the heuristic can cause...
-
2013
Fuegito is an educational software package for learning about programming two player games. The package provides a simple, yet flexible and extensible framework which allows students to study the core search algorithms of computer game-playing, and extend them easily in projects. The current...
-
2013
Valenzano, Richard, Müller, Martin, Xie, Fan
Most of the satisficing planners which are based on heuristic search iteratively improve their solution quality through an anytime approach. Typically, the lowest-cost solution found so far is used to constrain the search. This avoids areas of the state space which cannot directly lead to lower...
-
2012
Bowling, Michael, Zinkevich, Martin
Online learning aims to perform nearly as well as the best hypothesis in hindsight. For some hypothesis classes, though, even finding the best hypothesis offline is challenging. In such offline cases, local search techniques are often employed and only local optimality guaranteed. For online...
-
2012
Lanctot, Marc, Gibson, Richard, Burch, Neil, Szafron, Duane
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. While the base algorithm performs a full tree traversal on each iteration, Monte Carlo CFR (MCCFR) reduces the per...
-
2011
Technical report TR11-01. Causality is a fundamental concept in reasoning. The effectiveness of many reasoning tasks depends on the understanding of the underlying cause-effect relationships. Therefore, the notion of causality has been explored in a wide range of disciplines. Causal discovery,...