no code implementations • 26 Sep 2019 • Florian Pommerening, Malte Helmert, Blai Bonet
Potential heuristics for state-space search are defined as weighted sums over simple state features.
no code implementations • 30 Jul 2019 • Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant
For graph search, A* can require $\Omega(2^{n})$ expansions, where $n$ is the number of states within the final $f$ bound.
no code implementations • 7 Jun 2019 • Nathan Sturtevant, Malte Helmert
The iterative deepening process is used to avoid overshooting the appropriate cost bound and doing too much work as a result.
no code implementations • 15 Jan 2014 • Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore
The special case, which we term "forward effects", is characterized by the fact that every ramification of a web service application involves at least one new constant generated as output by the web service.