Sciweavers

AI
2011
Springer
13 years 6 months ago
Inconsistent heuristics in theory and practice
Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan S...
AI
2011
Springer
13 years 6 months ago
Expressive markets for donating to charities
When donating money to a (say, charitable) cause, it is possible to use the contemplated donation as a bargaining chip to induce other parties interested in the charity to donate ...
Vincent Conitzer, Tuomas Sandholm
AI
2011
Springer
13 years 6 months ago
Relational preference rules for control
Much like relational probabilistic models, the need for relational preference models arises naturally in real-world applications where the set of object classes is fixed, but obj...
Ronen I. Brafman
AI
2011
Springer
13 years 6 months ago
Learning qualitative models from numerical data
Qualitative models are often a useful abstraction of the physical world. Learning qualitative models from numerical data sible way to obtain such an abstraction. We present a new ...
Jure Zabkar, Martin Mozina, Ivan Bratko, Janez Dem...
AI
2011
Springer
13 years 6 months ago
Contracting preference relations for database applications
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
Denis Mindolin, Jan Chomicki
AI
2011
Springer
13 years 6 months ago
Representing preferences using intervals
In this paper we present a general framework for the comparison of intervals when preference relations have to established. The use of intervals in order to take into account impr...
Meltem Öztürk, Marc Pirlot, Alexis Tsouk...
AI
2011
Springer
13 years 6 months ago
Computer poker: A review
Jonathan Rubin, Ian Watson
AI
2011
Springer
13 years 6 months ago
A survey of motivation frameworks for intelligent systems
The ability to achieve one’s goals is a defining characteristic of intelligent behaviour. A great many existing theories, systems and research programmes address the problems a...
Nick Hawes
AI
2011
Springer
13 years 6 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
AI
2011
Springer
13 years 6 months ago
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...