Sciweavers

ECAI
2010
Springer
13 years 10 months ago
Sound and Complete Landmarks for And/Or Graphs
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
Emil Keyder, Silvia Richter, Malte Helmert
ECAI
2010
Springer
13 years 10 months ago
Case-Based Multiagent Reinforcement Learning: Cases as Heuristics for Selection of Actions
This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Multiagent Reinforcement Learning algorithms, combining Case-Based Reasoning...
Reinaldo A. C. Bianchi, Ramon López de M&aa...
ECAI
2010
Springer
13 years 10 months ago
Strengthening Landmark Heuristics via Hitting Sets
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
Blai Bonet, Malte Helmert
ECAI
2010
Springer
13 years 10 months ago
Learning better together
Gauvain Bourgne, Henry Soldano, Amal El Fallah-Seg...
ECAI
2010
Springer
13 years 10 months ago
Context-Specific Independence in Directed Relational Probabilistic Models and its Influence on the Efficiency of Gibbs Sampling
Abstract. There is currently a large interest in relational probabilistic models. While the concept of context-specific independence (CSI) has been well-studied for models such as ...
Daan Fierens
ECAI
2010
Springer
13 years 10 months ago
An Empirical Study of the Manipulability of Single Transferable Voting
Abstract. Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences....
Toby Walsh