default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJendrik Seipp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Ayal Taitler
, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fiser, Michael Gimelfarb, Florian Pommerening, Scott Sanner, Enrico Scala, Dominik Schreiber, Javier Segovia-Aguas, Jendrik Seipp:
The 2023 International Planning Competition. AI Mag. 45(2): 280-296 (2024)- [j3]Dominik Drexler, Jendrik Seipp, Hector Geffner:
Expressing and Exploiting Subgoal Structure in Classical Planning Using Sketches. J. Artif. Intell. Res. 80 (2024) - [c39]Jendrik Seipp:
Dissecting Scorpion: Ablation Study of an Optimal Classical Planner. ECAI 2024: 39-42 - [c38]Mika Skjelnes, Daniel Gnad, Jendrik Seipp:
Cost Partitioning for Multiple Sequence Alignment. ECAI 2024: 4224-4231 - [c37]Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert:
Abstraction Heuristics for Factored Tasks. ICAPS 2024: 40-49 - [c36]Paul Höft, David Speck, Florian Pommerening, Jendrik Seipp:
Versatile Cost Partitioning with Exact Sensitivity Analysis. ICAPS 2024: 276-280 - [c35]Jendrik Seipp:
Efficiently Computing Transitions in Cartesian Abstractions. ICAPS 2024: 509-513 - [i5]Augusto B. Corrêa, Jendrik Seipp:
Consolidating LAMA with Best-First Width Search. CoRR abs/2404.17648 (2024) - [i4]Kristina Levina, Nikolaos Pappas, Athanasios Karapantelakis, Aneta Vulgarakis Feljan, Jendrik Seipp:
Numeric Reward Machines. CoRR abs/2404.19370 (2024) - [i3]Elliot Gestrin, Marco Kuhlmann, Jendrik Seipp:
NL2Plan: Robust LLM-Driven Planning from Minimal Text Descriptions. CoRR abs/2405.04215 (2024) - 2023
- [c34]David Speck, Paul Höft, Daniel Gnad, Jendrik Seipp:
Finding Matrix Multiplication Algorithms with Classical Planning. ICAPS 2023: 411-416 - [c33]Remo Christen, Salomé Eriksson, Michael Katz, Christian Muise, Alice Petrov, Florian Pommerening, Jendrik Seipp, Silvan Sievers, David Speck:
PARIS: Planning Algorithms for Reconfiguring Independent Sets. ECAI 2023: 453-460 - [c32]Paul Höft, David Speck, Jendrik Seipp:
Sensitivity Analysis for Saturated Post-Hoc Optimization in Classical Planning. ECAI 2023: 1044-1051 - [c31]Thorsten Klößner, Jendrik Seipp, Marcel Steinmetz:
Cartesian Abstractions and Saturated Cost Partitioning in Probabilistic Planning. ECAI 2023: 1272-1279 - [c30]Dominik Drexler, Jendrik Seipp, Hector Geffner:
Learning Hierarchical Policies by Iteratively Reducing the Width of Sketch Rules. KR 2023: 208-218 - [c29]Mauricio Salerno, Raquel Fuentetaja, Jendrik Seipp:
Eliminating Redundant Actions from Plans Using Classical Planning. KR 2023: 774-778 - 2022
- [c28]Patrick Ferber, Jendrik Seipp:
Explainable Planner Selection for Classical Planning. AAAI 2022: 9741-9749 - [c27]Augusto B. Corrêa, Jendrik Seipp:
Best-First Width Search for Lifted Classical Planning. ICAPS 2022: 11-15 - [c26]Dominik Drexler, Jendrik Seipp, Hector Geffner:
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width. ICAPS 2022: 62-70 - [c25]David Speck, Jendrik Seipp:
New Refinement Strategies for Cartesian Abstractions. ICAPS 2022: 348-352 - [c24]Patrick Ferber, Liat Cohen, Jendrik Seipp, Thomas Keller:
Learning and Exploiting Progress States in Greedy Best-First Search. IJCAI 2022: 4740-4746 - [d1]Jendrik Seipp, Álvaro Torralba, Jörg Hoffmann:
PDDL Generators. Zenodo, 2022
- [i2]Dominik Drexler, Jendrik Seipp, Hector Geffner:
Learning Sketches for Decomposing Planning Problems into Subproblems of Bounded Width: Extended Version. CoRR abs/2203.14852 (2022) - 2021
- [c23]Jendrik Seipp, Thomas Keller, Malte Helmert:
Saturated Post-hoc Optimization for Classical Planning. AAAI 2021: 11947-11953 - [c22]Dominik Drexler, Jendrik Seipp, David Speck:
Subset-Saturated Transition Cost Partitioning. ICAPS 2021: 131-139 - [c21]Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert:
Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS 2021: 271-280 - [c20]Jendrik Seipp:
Online Saturated Cost Partitioning for Classical Planning. ICAPS 2021: 317-321 - [c19]Álvaro Torralba, Jendrik Seipp, Silvan Sievers:
Automatic Instance Generation for Classical Planning. ICAPS 2021: 376-384 - [c18]Simon Ståhlberg, Guillem Francès, Jendrik Seipp:
Learning Generalized Unsolvability Heuristics for Classical Planning. IJCAI 2021: 4175-4181 - [c17]Dominik Drexler, Jendrik Seipp, Hector Geffner:
Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches. KR 2021: 258-268 - [i1]Dominik Drexler, Jendrik Seipp, Hector Geffner:
Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches: Extended Version. CoRR abs/2105.04250 (2021) - 2020
- [j2]Jendrik Seipp, Thomas Keller, Malte Helmert:
Saturated Cost Partitioning for Optimal Classical Planning. J. Artif. Intell. Res. 67: 129-167 (2020) - [c16]Jendrik Seipp, Samuel von Allmen, Malte Helmert:
Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. ICAPS 2020: 244-248 - [c15]Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers:
An Atom-Centric Perspective on Stubborn Sets. SOCS 2020: 57-65
2010 – 2019
- 2019
- [c14]Jendrik Seipp, Malte Helmert:
Subset-Saturated Cost Partitioning for Optimal Classical Planning. ICAPS 2019: 391-400 - [c13]Jendrik Seipp:
Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning. IJCAI 2019: 5621-5627 - 2018
- [j1]Jendrik Seipp, Malte Helmert:
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. J. Artif. Intell. Res. 62: 535-577 (2018) - 2017
- [c12]Jendrik Seipp, Thomas Keller, Malte Helmert:
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. AAAI 2017: 3651-3657 - [c11]Jendrik Seipp, Thomas Keller, Malte Helmert:
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. ICAPS 2017: 259-268 - [c10]Jendrik Seipp:
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning. SOCS 2017: 149-153 - 2016
- [c9]Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer, Robert Mattmüller:
State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning. IJCAI 2016: 3161-3169 - [c8]Jendrik Seipp, Florian Pommerening, Gabriele Röger, Malte Helmert:
Correlation Complexity of Classical Planning Domains. IJCAI 2016: 3242-3250 - 2015
- [c7]Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp:
From Non-Negative to General Operator Cost Partitioning. AAAI 2015: 3335-3341 - [c6]Jendrik Seipp, Silvan Sievers, Malte Helmert, Frank Hutter:
Automatic Configuration of Sequential Planning Portfolios. AAAI 2015: 3364-3370 - [c5]Jendrik Seipp, Florian Pommerening, Malte Helmert:
New Optimization Functions for Potential Heuristics. ICAPS 2015: 193-201 - 2014
- [c4]Jendrik Seipp, Malte Helmert:
Diverse and Additive Cartesian Abstraction Heuristics. ICAPS 2014 - 2013
- [c3]Jendrik Seipp, Malte Helmert:
Additive Counterexample-Guided Cartesian Abstraction Refinement. AAAI (Late-Breaking Developments) 2013 - [c2]Jendrik Seipp, Malte Helmert:
Counterexample-Guided Cartesian Abstraction Refinement. ICAPS 2013 - 2012
- [c1]Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert:
Learning Portfolios of Automatically Tuned Planners. ICAPS 2012
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 21:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
