14 search results - page 1 / 3 » A* Search via Approximate Factoring |
AAAI
2007
13 years 7 months ago
2007
IJCAI
2001
13 years 6 months ago
2001
This paper describes an algorithm for solving large state-space MDPs (represented as factored MDPs) using search by successive refinement in the space of non-homogeneous partition...
AIRWEB
2005
Springer
13 years 10 months ago
2005
Springer
This paper investigates the influence of different page features on the ranking of search engine results. We use Google (via its API) as our testbed and analyze the result rankin...
IPL
2011
12 years 11 months ago
2011
Consider the following problem. Given n sets of sets A1, . . . , Au with elements over a universe E = {e1, . . . , en}, the goal is to select exactly one set from each of A1, . . ...
AI
2011
Springer
12 years 12 months ago
2011
Springer
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...