On the public citation graph

The IBaCoP Planning System: Instance-Based Configured Portfolios

0 signed · 72 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_28openalex-snapshot
Planning as Heuristic Search: New Results
inferredcites →https://doi.org/10.1007/10720246_5openalex-snapshot
Exploiting Competitive Planner Performance
inferredcites →https://doi.org/10.1007/3-540-45014-9_1openalex-snapshot
Ensemble Methods in Machine Learning
inferredcites →https://doi.org/10.1007/3-540-59286-5_57openalex-snapshot
The power of decision tables
inferredcites →https://doi.org/10.1007/978-3-319-09584-4_3openalex-snapshot
Portfolio Approaches for Constraint Optimization Problems
inferredcites →https://doi.org/10.1007/978-3-319-19084-6_1openalex-snapshot
From Sequential Algorithm Selection to Parallel Portfolio Selection
inferredcites →https://doi.org/10.1007/978-3-642-25566-3_40openalex-snapshot
Sequential Model-Based Optimization for General Algorithm Configuration
inferredcites →https://doi.org/10.1007/978-3-642-31612-8_18openalex-snapshot
Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors
inferredcites →https://doi.org/10.1007/978-3-642-35455-7_6openalex-snapshot
A Guide to Portfolio-Based Planning
inferredcites →https://doi.org/10.1007/bf01442131openalex-snapshot
Pareto optimality in multiobjective problems
inferredcites →https://doi.org/10.1007/s10472-015-9459-5openalex-snapshot
Portfolio approaches for constraint optimization problems
inferredcites →https://doi.org/10.1016/0260-8774(87)90009-4openalex-snapshot
Sensory evaluation of food — Statistical methods and procedures
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.013openalex-snapshot
Concise finite-domain representations for PDDL planning tasks
inferredcites →https://doi.org/10.1016/j.artint.2008.11.009openalex-snapshot
Learning from planner performance
inferredcites →https://doi.org/10.1016/j.artint.2014.12.008openalex-snapshot
Red–black planning: A new systematic approach to partial delete relaxation
inferredcites →https://doi.org/10.1016/j.artint.2015.01.004openalex-snapshot
The deterministic part of the seventh International Planning Competition
inferredcites →https://doi.org/10.1016/j.artint.2015.05.005openalex-snapshot
Automatic construction of optimal static sequential portfolios for AI planning and beyond
inferredcites →https://doi.org/10.1016/s0004-3702(00)00081-3openalex-snapshot
Algorithm portfolios
inferredcites →https://doi.org/10.1016/s0004-3702(97)00063-5openalex-snapshot
Selection of relevant features and examples in machine learning
inferredcites →https://doi.org/10.1017/s1471068414000179openalex-snapshot
SUNNY: a Lazy Portfolio Approach for Constraint Solving
inferredcites →https://doi.org/10.1023/a:1010933404324openalex-snapshot
Random Forests
inferredcites →https://doi.org/10.1023/a:1018054314350openalex-snapshot
Bagging Predictors
inferredcites →https://doi.org/10.1109/ichis.2005.43openalex-snapshot
Feature selection with decision tree criterion
inferredcites →https://doi.org/10.1109/tpami.2006.211openalex-snapshot
Rotation Forest: A New Classifier Ensemble Method
inferredcites →https://doi.org/10.1515/9781618117021openalex-snapshot
Landmarks Revisited
inferredcites →https://doi.org/10.1609/aaai.v24i1.7565openalex-snapshot
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection
inferredcites →https://doi.org/10.1609/aaai.v28i1.9035openalex-snapshot
Adding Local Exploration to Greedy Best-First Search in Satisficing Planning
inferredcites →https://doi.org/10.1609/aaai.v29i1.9640openalex-snapshot
Automatic Configuration of Sequential Planning Portfolios
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
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.13470openalex-snapshot
Searching for Plans with Carefully Designed Probes
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.1613/jair.1742openalex-snapshot
An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events
inferredcites →https://doi.org/10.1613/jair.1982openalex-snapshot
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
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.3276openalex-snapshot
Analyzing Search Topology Without Running Any Search: On the Connection Between Causal Graphs and h+
inferredcites →https://doi.org/10.1613/jair.4359openalex-snapshot
Planning through Automatic Portfolio Configuration: The PbP Approach
inferredcites →https://doi.org/10.1613/jair.4726openalex-snapshot
AutoFolio: An Automatically Configured Algorithm Selector
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.3233/aic-150671openalex-snapshot
Portfolio-based planning: State of the art, common practice and open challenges
inferredcites →https://doi.org/10.4230/lipics.iclp.2012.176openalex-snapshot
aspeed: ASP-based Solver Scheduling
inferredcites →https://doi.org/10.5860/choice.49-3305openalex-snapshot
Data mining: concepts and techniques

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.2020.103414openalex-snapshot
Selecting goals in oversubscription planning using relaxed plans
inferred← citeshttps://doi.org/10.1016/j.ejor.2022.01.034openalex-snapshot
An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning
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/icdcsw53096.2021.00013openalex-snapshot
QROSS: QUBO Relaxation Parameter optimisation via Learning Solver Surrogates
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.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.14393/ufu.di.2019.1285openalex-snapshot
Uma abordagem para planejamento instrucional apoiada em processos de decisão Markovianos parcialmente observáveis
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.12091openalex-snapshot
Meta-Search Through the Space of Representations and Heuristics on a Problem by Problem Basis
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33017715openalex-snapshot
Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection
inferred← citeshttps://doi.org/10.1609/aaai.v34i04.5949openalex-snapshot
Online Planner Selection with Graph Neural Networks and Adaptive Scheduling
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17451openalex-snapshot
Generalization in Portfolio-Based Algorithm Selection
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21209openalex-snapshot
Explainable Planner Selection for Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v27i1.13848openalex-snapshot
Performance Modelling of Planners from Homogeneous Problem Sets
inferred← citeshttps://doi.org/10.1609/icaps.v29i1.3531openalex-snapshot
Learning Classical Planning Strategies with Policy Gradient
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6748openalex-snapshot
Learning Neural Search Policies for Classical Planning
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6753openalex-snapshot
Generating and Exploiting Cost Predictions in Heuristic State-Space Planning
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.16008openalex-snapshot
Learning Heuristic Selection with Dynamic Algorithm Configuration
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19788openalex-snapshot
Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search
inferred← citeshttps://doi.org/10.20868/upm.thesis.46988openalex-snapshot
Diseño e implementación de un planificador para un agente autónomo
inferred← citeshttps://doi.org/10.24963/ijcai.2017/602openalex-snapshot
Beyond Forks: Finding and Ranking Star Factorings for Decoupled Search
inferred← citeshttps://doi.org/10.24963/ijcai.2021/567openalex-snapshot
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning
inferred← citeshttps://doi.org/10.48550/arxiv.1502.03986openalex-snapshot
A Multicore Tool for Constraint Solving
inferred← citeshttps://doi.org/10.48550/arxiv.1811.00210openalex-snapshot
Online Planner Selection with Graph Neural Networks and Adaptive Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.2006.00715openalex-snapshot
Towards Feature-free TSP Solver Selection: A Deep Learning Approach
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.