Volgen
Daniel Gnad
Daniel Gnad
Linköping University, Sweden
Geverifieerd e-mailadres voor liu.se - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Learning How to Ground a Plan - Partial Grounding in Classical Planning
D Gnad, A Torralba, M Dominguez, C Areces, F Bustos
AAAI, 2019
412019
Star-topology decoupled state space search
D Gnad, J Hoffmann
Artificial Intelligence 257, 24-60, 2018
362018
Beating LM-Cut with hmax (Sometimes): Fork-Decoupled State Space Search.
D Gnad, J Hoffmann
Proceedings of the 25th International Conference on Automated Planning and …, 2015
292015
SaarPlan: Combining Saarland’s Greatest Planning Techniques
M Fickert, D Gnad, P Speicher, J Hoffmann
IPC2018–Classical Tracks, 10-15, 2018
212018
Symmetry breaking in star-topology decoupled search
D Gnad, A Torralba, A Shleyfman, J Hoffmann
Proceedings of the 27th International Conference on Automated Planning and …, 2017
182017
From fork decoupling to star-topology decoupling
D Gnad, J Hoffmann, C Domshlak
Eighth Annual Symposium on Combinatorial Search, 2015
172015
Decstar–STAR-topology DECoupled Search at its best
D Gnad, A Shleyfman, J Hoffmann
IPC-9 planner abstracts, 42-46, 2018
152018
Beyond forks: Finding and ranking star factorings for decoupled search
D Gnad, V Poser, J Hoffmann, SI Campus
Proceedings of the 26th International Joint Conference on Artificial …, 2017
132017
Decoupled Strong Stubborn Sets
D Gnad, M Wehrle, J Hoffmann
Proceedings of the 25th International Joint Conference on Artificial …, 2016
132016
On state-dominance criteria in fork-decoupled search
A Torralba, D Gnad, P Dubbert, J Hoffmann
Proceedings of the 25th International Joint Conference on Artificial …, 2016
112016
Red-black planning: A new tractability analysis and heuristic function
D Gnad, J Hoffmann
Eighth Annual Symposium on Combinatorial Search, 2015
102015
Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search
D Gnad, J Hoffmann, M Wehrle
Journal of Artificial Intelligence Research 65, 343-392, 2019
82019
Finding matrix multiplication algorithms with classical planning
D Speck, P Höft, D Gnad, J Seipp
Proceedings of the International Conference on Automated Planning and …, 2023
72023
Django: Unchaining the power of red-black planning
D Gnad, M Steinmetz, J Hoffmann
UIPC 2016 Planner Abstracts, 19-23, 2016
62016
Planning over integers: Compilations and undecidability
D Gnad, M Helmert, P Jonsson, A Shleyfman
Proceedings of the International Conference on Automated Planning and …, 2023
52023
Symbolic Leaf Representation in Decoupled Search
D Gnad, A Torralba, J Hoffmann
Tenth Annual Symposium on Combinatorial Search, 2017
52017
Partial delete relaxation, unchained: On intractable red-black planning and its applications
D Gnad, M Steinmetz, M Jany, J Hoffmann, I Serina, A Gerevini
Ninth Annual Symposium on Combinatorial Search, 2016
52016
Structurally Restricted Fragments of Numeric Planning–a Complexity Analysis
A Shleyfman, D Gnad, P Jonsson
AAAI 2023, 2023
42023
Custom-Design of FDR Encodings: The Case of Red-Black Planning
D Fišer, D Gnad, M Katz, J Hoffmann
42021
On the Relation between Star-Topology Decoupling and Petri Net Unfolding
D Gnad, J Hoffmann
ICAPS'19, 2019
42019
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20