Items where Author is "Haslum, Patrik"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: Item Type | No Grouping
Number of items: 7.

Conference or Workshop Item (A Paper)

Daum, Jeanette and Torralba, Àlvaro and Hoffmann, Jörg and Haslum, Patrik and Weber, Ingo
(2016) Practical Undoability Checking via Contingent Planning.
In: Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS'16).
Conference: ICAPS International Conference on Automated Planning and Scheduling

Keyder, Emil Ragip and Hoffmann, Jörg and Haslum, Patrik
(2012) Semi-Relaxed Plan Heuristics.
In: Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012, Atibaia, São Paulo, Brazil, June 25-19, 2012.
Conference: ICAPS International Conference on Automated Planning and Scheduling

Keyder, Emil Ragip and Hoffmann, Jörg and Haslum, Patrik
(2012) Semi-Relaxed Plan Heuristics.
In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada..
Conference: AAAI National Conference of the American Association for Artificial Intelligence

Helmert, Malte and Haslum, Patrik and Hoffmann, Jörg
(2008) Explicit-State Abstraction: A New Method for Generating Heuristic Functions.
In: Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008.

Helmert, Malte and Haslum, Patrik and Hoffmann, Jörg
(2007) Flexible Abstraction Heuristics for Optimal Sequential Planning.
In: Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, ICAPS 2007, Providence, Rhode Island, USA, September 22-26, 2007.

Article

Keyder, Emil Ragip and Hoffmann, Jörg and Haslum, Patrik
(2014) Improving Delete Relaxation Heuristics Through Explicitly Represented Conjunctions.
J. Artif. Intell. Res., 50. 487–533.

Helmert, Malte and Haslum, Patrik and Hoffmann, Jörg and Nissim, Raz
(2014) Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces.
J. ACM, 61 (3). 16:1–16:63.

This list was generated on Sun Nov 28 00:03:45 2021 CET.