Search the dblp DataBase
Malte Helmert :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Malte Helmert A Planning Heuristic Based on Causal Graph Analysis. [Citation Graph (0, 0)][DBLP ] ICAPS, 2004, pp:161-170 [Conf ] Malte Helmert , Robert Mattmüller , Sven Schewe Selective Approaches for Solving Weak Games. [Citation Graph (0, 0)][DBLP ] ATVA, 2006, pp:200-214 [Conf ] Malte Helmert , Robert Mattmüller , Gabi Röger Aproximation Properties of Planning Benchmarks. [Citation Graph (0, 0)][DBLP ] ECAI, 2006, pp:585-589 [Conf ] Stefan Edelkamp , Malte Helmert Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. [Citation Graph (0, 0)][DBLP ] ECP, 1999, pp:135-147 [Conf ] Malte Helmert Decidability and Undecidability Results for Planning with Numerical State Variables. [Citation Graph (0, 0)][DBLP ] PuK, 2002, pp:- [Conf ] Malte Helmert Complexity results for standard benchmark domains in planning. [Citation Graph (0, 0)][DBLP ] Artif. Intell., 2003, v:143, n:2, pp:219-262 [Journal ] Stefan Edelkamp , Malte Helmert MIPS: The Model-Checking Integrated Planning System. [Citation Graph (0, 0)][DBLP ] AI Magazine, 2001, v:22, n:3, pp:67-72 [Journal ] Patrik Haslum , Adi Botea , Malte Helmert , Blai Bonet , Sven Koenig Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. [Citation Graph (0, 0)][DBLP ] AAAI, 2007, pp:1007-1012 [Conf ] Malte Helmert New Complexity Results for Classical Planning Benchmarks. [Citation Graph (0, 0)][DBLP ] ICAPS, 2006, pp:52-62 [Conf ] Sebastian Kupferschmid , Malte Helmert A Skat Player Based on Monte-Carlo Simulation. [Citation Graph (0, 0)][DBLP ] Computers and Games, 2006, pp:135-147 [Conf ] Silvia Richter , Malte Helmert , Charles Gretton A Stochastic Local Search Approach to Vertex Cover. [Citation Graph (0, 0)][DBLP ] KI, 2007, pp:412-426 [Conf ] Malte Helmert The Fast Downward Planning System. [Citation Graph (0, 0)][DBLP ] J. Artif. Intell. Res. (JAIR), 2006, v:26, n:, pp:191-246 [Journal ] Explicit-State Abstraction: A New Method for Generating Heuristic Functions. [Citation Graph (, )][DBLP ] How Good is Almost Perfect?. [Citation Graph (, )][DBLP ] Landmarks Revisited. [Citation Graph (, )][DBLP ] Accuracy of Admissible Heuristic Functions in Selected Planning Domains. [Citation Graph (, )][DBLP ] High-Quality Policies for the Canadian Traveler's Problem. [Citation Graph (, )][DBLP ] Flexible Abstraction Heuristics for Optimal Sequential Planning. [Citation Graph (, )][DBLP ] Unifying the Causal Graph and Additive Heuristics. [Citation Graph (, )][DBLP ] Pattern Database Heuristics for Fully Observable Nondeterministic Planning. [Citation Graph (, )][DBLP ] Decidability and Undecidability Results for Planning with Numerical State Variables. [Citation Graph (, )][DBLP ] Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? [Citation Graph (, )][DBLP ] Preferred Operators and Deferred Evaluation in Satisficing Planning. [Citation Graph (, )][DBLP ] Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. [Citation Graph (, )][DBLP ] The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. [Citation Graph (, )][DBLP ] The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. [Citation Graph (, )][DBLP ] Strengthening Landmark Heuristics via Hitting Sets. [Citation Graph (, )][DBLP ] Sound and Complete Landmarks for And/Or Graphs. [Citation Graph (, )][DBLP ] Relative-Order Abstractions for the Pancake Problem. [Citation Graph (, )][DBLP ] Planning with h + in Theory and Practice. [Citation Graph (, )][DBLP ] On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle. [Citation Graph (, )][DBLP ] The Causal Graph Revisited for Directed Model Checking. [Citation Graph (, )][DBLP ] Concise finite-domain representations for PDDL planning tasks. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs