Sciweavers

AAAI
2010
13 years 6 months ago
Finding Optimal Solutions to Cooperative Pathfinding Problems
In cooperative pathfinding problems, non-interfering paths that bring each agent from its current state to its goal state must be planned for multiple agents. We present the first...
Trevor Scott Standley
AAAI
2010
13 years 6 months ago
Automated Channel Abstraction for Advertising Auctions
William E. Walsh, Craig Boutilier, Tuomas Sandholm...
AAAI
2010
13 years 6 months ago
Node Selection Query Languages for Trees
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
AAAI
2010
13 years 6 months ago
Efficient Spectral Feature Selection with Minimum Redundancy
Spectral feature selection identifies relevant features by measuring their capability of preserving sample similarity. It provides a powerful framework for both supervised and uns...
Zheng Zhao, Lei Wang, Huan Liu
AAAI
2010
13 years 6 months ago
Learning Simulation Control in General Game-Playing Agents
The aim of General Game Playing (GGP) is to create intelligent agents that can automatically learn how to play many different games at an expert level without any human interventi...
Hilmar Finnsson, Yngvi Björnsson
AAAI
2010
13 years 6 months ago
Voting Almost Maximizes Social Welfare Despite Limited Communication
In cooperative multiagent systems an alternative that maximizes the social welfare--the sum of utilities--can only be selected if each agent reports its full utility function. Thi...
Ioannis Caragiannis, Ariel D. Procaccia
AAAI
2010
13 years 6 months ago
SAP Speaks PDDL
In several application areas for Planning, in particular helping with the creation of new processes in Business Process Management (BPM), a major obstacle lies in the modeling. Ob...
Jörg Hoffmann, Ingo Weber, Frank Michael Kraf...
AAAI
2010
13 years 6 months ago
Robust Policy Computation in Reward-Uncertain MDPs Using Nondominated Policies
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
Kevin Regan, Craig Boutilier
AAAI
2010
13 years 6 months ago
Evolving Compiler Heuristics to Manage Communication and Contention
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
Matthew E. Taylor, Katherine E. Coons, Behnam Roba...