Search
Skip to Search Results- 10Zaiane, Osmar
- 5Nascimento, Mario
- 4Nascimento, Mario A.
- 3Bowling, Michael
- 3Oliveira, Stanley
- 3Schaeffer, Jonathan
-
Fuego - An Open-source Framework for Board Games and Go Engine Based on Monte-Carlo Tree Search
Download2009
Enzenberger, Markus, Mueller, Martin
Technical report TR09-08. Fuego is an open-source software framework for developing game engines for full-information two-player board games, with a focus on the game of Go. It was mainly developed by the Computer Go group of the University of Alberta. Fuego includes a Go engine with a playing...
-
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...
-
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...
-
2003
Oliveira, Stanley, Zaiane, Osmar
Technical report TR03-12. Despite its benefit in a wide range of applications, data mining techniques also have raised a number of ethical issues. Some such issues include those of privacy, data security, intellectual property rights, and many others. In this paper, we address the privacy problem...
-
2011
Nascimento, Mario A, Ammar, Khaled
Technical report TR11-03. Wireless Sensor Networks (WSNs) are typically used to collect values of some phenomena in a monitored area. In many applications, users are interested in summaries of the observed data, e.g., a histogram reflecting the distribution of the collected values. However,...
-
Inverted Matrix: Efficient Discovery of Frequent Items in Large Datasets in the Context of Interactive Mining
Download2003
El-Hajj, Mohammad, Zaiane, Osmar
Technical report TR03-08. Existing association rule mining algorithms suffer from many problems when mining massive transactional datasets. One major problem is the high memory dependency: either the gigantic data structure built is assumed to fit in main memory, or the recursive mining process...
-
2012
Kazemeyni, Fatemah, Owe, Olaf, Johnsen, Einar Broch, Balasingham, Ilangko, Nascimento, Mario A.
Technical report TR12-01. Limited energy supply is a chief concern when dealing with wireless sensor networks (WSNs). Thus, among other issues, routing protocols for WSNs should be designed with the goal of being energy efficient in the first place. For static networks this is already a...
-
1992
Technical report TR92-19. In August 1992, the first man versus machine world championship took place. The champion, Dr. Marion Tinsley, is arguably the greatest checkers player that ever lived. The challenger was the computer checkers program Chinook, a 3 year team effort from the University of...
-
2004
Antonie, Maria-Luiza, Zaiane, Osmar
Technical report TR04-07. Typical association rules consider only items enumerated in transactions. Such rules are referred to as positive association rules. Negative association rules also consider the same items, but in addition consider negated items (i.e. absent from transactions). Negative...