Search
Skip to Search Results- 4Müller, Martin
- 3Mueller, Martin
- 2Johanson, Michael
- 2Nakhost, Hootan
- 2Schaeffer, Jonathan
- 2Valenzano, Richard
-
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...
-
2010
Mueller, Martin, Hoffman, Joerg, Nakhost, Hootan
Technical report TR10-02. A ubiquitous feature of planning problems -- problems involving the automatic generation of action sequences for attaining a given goal -- is the need to economize limited resources such as fuel or money. While heuristic search, mostly based on standard algorithms such...
-
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...
-
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...
-
Fuego-GB Prototype at the Human machine competition in Barcelona 2010: a Tournament Report and Analysis
Download2010
Technical report TR10-08. A Human vs Computer Go competition took place in Barcelona, Spain on July 20, 2010. This report provides a report and some analysis of the games played by FUEGO-GB PROTOTYPE in this event. The program played well in its 9 x 9 games with White, winning against...
-
2010
Lin, Guohui, Shi, Xiaoyu, Hu, Yu, Zeng, Dahua, Zaiane, Osmar
Technical report TR10-04. This paper describes a novel and fast placement algorithm for field programmable gate array (FPGA) design space exploration. The proposed algorithm generates the placement based on the topological similarity between two configurations (netlists) in the design space....
-
2002
Fortin, David, Antoniu, Angela, Sardarli, Arzu, Rezania, Vahid, Levner, Ilya, Bulitko, Vadim
Technical report TR02-14. The 2002 Quantum Computing Summer School (QCSS'02) at the University of Alberta was organized as a learning and discussion forum for researchers in Artificial Intelligence, Computer Science, Physics, Mathematics, and Engineering. The short-term objective was to introduce...
-
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...