Search
Skip to Search Results- 85Artificial Intelligence
- 22Machine Learning
- 21Game theory
- 10Computer Games
- 10Reinforcement Learning
- 8Planning
- 4Müller, Martin
- 3Bowling, Michael
- 3Johanson, Michael
- 3Lanctot, Marc
- 3Mueller, Martin
- 3Zinkevich, Martin
- 65Graduate and Postdoctoral Studies (GPS), Faculty of
- 65Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
- 21Computing Science, Department of
- 21Computing Science, Department of/Technical Reports (Computing Science)
- 4Toolkit for Grant Success
- 4WISEST Summer Research Program
-
2017-12-01
Jeff Cho, Shelby Carleton, Aidan Herron, Maddy Hebert, Brandon Wieliczko, Kieran Downs
turing is a text adventure-style game created in RenPy using a custom-built text adventure engine. In this game, you play as a new employee of the mysterious Electric Sheep Inc. screening “candidates” through a chat interface to determine whether they are human or AI. Your interface to this...
-
[Review of the book Formal Methods in Artificial Intelligence, by Aamsay]
1996
Introduction: Many universities teach artificial intelligence (AI) by having one undergraduate course that introduces students to a very wide variety of topics, usually including search and search heuristics, representational systems (including formal logic), problem solving, vision, expert...
-
1991
Pelletier, Francis J., Schubert, Lenhart
Introduction: This very short book is apparently intended as a supplementary text in a graduate AI course. The author describes it as a \"text and reference work on the applications of non-standard logics to artificial intelligence (AI).\" It gives short and concise (too short and too concise, in...
-
Fall 2015
Brammadesam Manavalan, Yathirajan
Displaying believable emotional reactions in virtual characters is required in applications ranging from virtual-reality trainers to video games. Manual scripting is the most frequently used method and enables an arbitrarily high fidelity of the emotions displayed. However, scripting is labor...
-
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....
-
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement - Extended Version
Download2010
Nakhost, Hootan, Müller, Martin
Technical report TR10-01. Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become increasingly important. The most recent planning competition IPC-2008 used the cost of the...
-
Spring 2021
Learning about many things can provide numerous benefits to a reinforcement learning system. For example, learning many auxiliary value functions, in addition to optimizing the environmental reward, appears to improve both exploration and representation learning. The question we tackle in this...
-
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...
-
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...