On the public citation graph

Planning through Automatic Portfolio Configuration: The PbP Approach

0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/10720246_5openalex-snapshot
Exploiting Competitive Planner Performance
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_41openalex-snapshot
A Multi-engine Solver for Quantified Boolean Formulas
inferredcites →https://doi.org/10.1007/s10994-011-5234-yopenalex-snapshot
The first learning track of the international planning competition
inferredcites →https://doi.org/10.1007/springerreference_205502openalex-snapshot
Nonparametric Statistical Inference
inferredcites →https://doi.org/10.1016/0004-3702(75)90002-8openalex-snapshot
Optimal problem-solving search: All-or-none solutions
inferredcites →https://doi.org/10.1016/c2009-0-19715-5openalex-snapshot
Data Mining: Practical Machine Learning Tools and Techniques
inferredcites →https://doi.org/10.1016/j.artint.2008.10.012openalex-snapshot
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
inferredcites →https://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
inferredcites →https://doi.org/10.1016/s0004-3702(00)00081-3openalex-snapshot
Algorithm portfolios
inferredcites →https://doi.org/10.1016/s0004-3702(97)00034-9openalex-snapshot
Engineering and compiling planning domain models to promote validity and efficiency
inferredcites →https://doi.org/10.1016/s0004-3702(97)00035-0openalex-snapshot
An event driven integration reasoning scheme for handling dynamic threats in an unstructured environment
inferredcites →https://doi.org/10.1016/s0065-2458(08)60520-3openalex-snapshot
The Algorithm Selection Problem
inferredcites →https://doi.org/10.1080/00031305.1975.10479105openalex-snapshot
Ridge Regression in Practice
inferredcites →https://doi.org/10.1109/ictai.2004.120openalex-snapshot
VAL: automatic plan validation, continuous effects and mixed initiative planning using PDDL
inferredcites →https://doi.org/10.1109/ictai.2013.12openalex-snapshot
An Automatic Algorithm Selection Approach for Planning
inferredcites →https://doi.org/10.1111/j.1467-8640.1995.tb00052.xopenalex-snapshot
COMPLEXITY RESULTS FOR SAS+ PLANNING
inferredcites →https://doi.org/10.1111/j.1749-6632.1950.tb53974.xopenalex-snapshot
SOME RAPID APPROXIMATE STATISTICAL PROCEDURES
inferredcites →https://doi.org/10.1145/2001858.2002004openalex-snapshot
Instance-based parameter tuning for evolutionary AI planning
inferredcites →https://doi.org/10.1145/2001858.2002053openalex-snapshot
Instance-based parameter tuning for evolutionary AI planning
inferredcites →https://doi.org/10.1146/annurev.ps.46.020195.003021openalex-snapshot
Multiple Hypothesis Testing
inferredcites →https://doi.org/10.1201/9781003091479-1openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1609/aimag.v33i1.2392openalex-snapshot
A Survey of the Seventh International Planning Competition
inferredcites →https://doi.org/10.1609/icaps.v19i1.13386openalex-snapshot
An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP
inferredcites →https://doi.org/10.1609/icaps.v21i1.13445openalex-snapshot
LPRPG-P: Relaxed Plan Heuristics for Planning with Preferences
inferredcites →https://doi.org/10.1609/icaps.v22i1.13538openalex-snapshot
Learning Portfolios of Automatically Tuned Planners
inferredcites →https://doi.org/10.1609/icaps.v24i1.13680openalex-snapshot
Improved Features for Runtime Prediction of Domain-Independent Planners
inferredcites →https://doi.org/10.1609/socs.v1i1.18159openalex-snapshot
Bootstrap Learning of Heuristic Functions
inferredcites →https://doi.org/10.1609/socs.v4i1.18293openalex-snapshot
Automatic Generation of Efficient Domain-Optimized Planners from Generic Parametrized Planners
inferredcites →https://doi.org/10.1613/jair.1129openalex-snapshot
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
inferredcites →https://doi.org/10.1613/jair.1183openalex-snapshot
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
inferredcites →https://doi.org/10.1613/jair.1240openalex-snapshot
The 3rd International Planning Competition: Results and Analysis
inferredcites →https://doi.org/10.1613/jair.1696openalex-snapshot
Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators
inferredcites →https://doi.org/10.1613/jair.1742openalex-snapshot
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
inferredcites →https://doi.org/10.1613/jair.1918openalex-snapshot
Temporal Planning using Subgoal Partitioning and Resolution in SGPlan
inferredcites →https://doi.org/10.1613/jair.2490openalex-snapshot
SATzilla: Portfolio-based Algorithm Selection for SAT
inferredcites →https://doi.org/10.1613/jair.2861openalex-snapshot
ParamILS: An Automatic Algorithm Configuration Framework
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.21236/ada009141openalex-snapshot
Optimal Problem-Solving Search: All-or-None Solutions
inferredcites →https://doi.org/10.3233/978-1-58603-891-5-911openalex-snapshot
A MAX-SAT Algorithm Portfolio
inferredcites →https://doi.org/10.3233/978-1-61499-098-7-240openalex-snapshot
On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements
inferredcites →https://doi.org/10.5555/1390681.1390705openalex-snapshot
Learning Control Knowledge for Forward Search Planning
inferredcites →https://doi.org/10.7939/r3qp6jopenalex-snapshot
Bootstrap Learning of Heuristic Functions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-93698-7_2openalex-snapshot
On the Configuration of Robust Static Parallel Portfolios for Efficient Plan Generation
inferred← citeshttps://doi.org/10.1007/s10817-021-09592-1openalex-snapshot
On the Importance of Domain Model Configuration for Automated Planning Engines
inferred← citeshttps://doi.org/10.1016/j.artint.2015.05.005openalex-snapshot
Automatic construction of optimal static sequential portfolios for AI planning and beyond
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.08.030openalex-snapshot
Automatically discovering clusters of algorithm and problem instance behaviors as well as their causes from experimental data, algorithm setups, and instance features
inferred← citeshttps://doi.org/10.1017/s0269888918000012openalex-snapshot
What you always wanted to know about the deterministic part of the International Planning Competition (IPC) 2014 (but were too afraid to ask)
inferred← citeshttps://doi.org/10.1017/s0269888923000097openalex-snapshot
Reformulation techniques for automated planning: a systematic review
inferred← citeshttps://doi.org/10.1080/0952813x.2019.1672796openalex-snapshot
MEvo: a framework for effective macro sets evolution
inferred← citeshttps://doi.org/10.1080/0952813x.2021.1970239openalex-snapshot
Improving Domain-Independent Heuristic State-Space Planning via plan cost predictions
inferred← citeshttps://doi.org/10.1109/ictai.2015.79openalex-snapshot
Portfolio Methods for Optimal Planning: An Empirical Analysis
inferred← citeshttps://doi.org/10.1109/ictai.2018.00081openalex-snapshot
Determining Representativeness of Training Plans: A Case of Macro-Operators
inferred← citeshttps://doi.org/10.1109/ictai50040.2020.00025openalex-snapshot
Configurable Heuristic Adaptation for Improving Best First Search in AI Planning
inferred← citeshttps://doi.org/10.1111/coin.12203openalex-snapshot
Inner entanglements: Narrowing the search in classical planning by problem reformulation
inferred← citeshttps://doi.org/10.1111/coin.12211openalex-snapshot
On the predictability of domain‐independent temporal planners
inferred← citeshttps://doi.org/10.1142/s0218213017600065openalex-snapshot
Static and Dynamic Portfolio Methods for Optimal Planning: An Empirical Analysis
inferred← citeshttps://doi.org/10.1145/3360901.3364416openalex-snapshot
On the Robustness of Domain-Independent Planning Engines
inferred← citeshttps://doi.org/10.1609/socs.v6i1.18351openalex-snapshot
Exploring the Synergy between Two Modular Learning Techniques for Automated Planning
inferred← citeshttps://doi.org/10.1613/jair.1.11388openalex-snapshot
AI Generality and Spearman’s Law of Diminishing Returns
inferred← citeshttps://doi.org/10.1613/jair.5080openalex-snapshot
The IBaCoP Planning System: Instance-Based Configured Portfolios
inferred← citeshttps://doi.org/10.3233/aic-150671openalex-snapshot
Portfolio-based planning: State of the art, common practice and open challenges
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.