ECAI
2010
Springer
13 years 12 months ago
2010
Springer
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...
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
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...
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
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...
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
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 ...
ECAI
2010
Springer
13 years 12 months ago
2010
Springer
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....