On the public citation graph

Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning

0 signed · 34 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/3-540-32363-5openalex-snapshot
Recent Advances in Memetic Algorithms
inferredcites →https://doi.org/10.1007/3-540-45356-3_83openalex-snapshot
A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II
inferredcites →https://doi.org/10.1016/0004-3702(70)90003-2openalex-snapshot
REF-ARF: A system for solving problems stated as procedures
inferredcites →https://doi.org/10.1016/0004-3702(71)90010-5openalex-snapshot
Strips: A new approach to the application of theorem proving to problem solving
inferredcites →https://doi.org/10.1016/0004-3702(87)90051-8openalex-snapshot
Planning as search: A quantitative approach
inferredcites →https://doi.org/10.1016/0004-3702(94)90081-7openalex-snapshot
The computational complexity of propositional STRIPS planning
inferredcites →https://doi.org/10.1016/j.artint.2005.08.004openalex-snapshot
Branching and pruning: An optimal temporal POCL planner based on constraint programming
inferredcites →https://doi.org/10.1109/4235.996017openalex-snapshot
A fast and elitist multiobjective genetic algorithm: NSGA-II
inferredcites →https://doi.org/10.1162/evco.1999.7.1.45openalex-snapshot
FOX-GA: A Genetic Algorithm for Generating and Analyzing Battlefield Courses of Action
inferredcites →https://doi.org/10.1609/aimag.v15i4.1109openalex-snapshot
An Introduction to Least Commitment Planning
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.544openalex-snapshot
The Automatic Inference of State Invariants in TIM
inferredcites →https://doi.org/10.1613/jair.715openalex-snapshot
On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm
inferredcites →https://doi.org/10.5555/777092.777274openalex-snapshot
Perspectives on artificial intelligence planning

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0515openalex-snapshot
Memetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_6openalex-snapshot
A Modern Introduction to Memetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-16468-7_17openalex-snapshot
True Pareto Fronts for Multi-objective AI Planning Instances
inferred← citeshttps://doi.org/10.1007/978-3-319-19084-6_25openalex-snapshot
Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve
inferred← citeshttps://doi.org/10.1007/978-3-540-72960-0_9openalex-snapshot
Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-01009-5_12openalex-snapshot
Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6 th International Planning Competition
inferred← citeshttps://doi.org/10.1007/978-3-642-12139-5_3openalex-snapshot
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme
inferred← citeshttps://doi.org/10.1007/978-3-642-35533-2_13openalex-snapshot
Learn-and-Optimize: A Parameter Tuning Framework for Evolutionary AI Planning
inferred← citeshttps://doi.org/10.1007/978-3-642-37140-0_7openalex-snapshot
Multi-objective AI Planning: Evaluating DaE YAHSP on a Tunable Benchmark
inferred← citeshttps://doi.org/10.1007/978-3-642-37198-1_18openalex-snapshot
Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches
inferred← citeshttps://doi.org/10.1007/978-3-642-44973-4_38openalex-snapshot
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning
inferred← citeshttps://doi.org/10.1145/1570256.1570301openalex-snapshot
Using performance fronts for parameter setting of stochastic metaheuristics
inferred← citeshttps://doi.org/10.1145/1830483.1830528openalex-snapshot
On the generality of parameter tuning in evolutionary planning
inferred← citeshttps://doi.org/10.1145/2001576.2001788openalex-snapshot
Parallel divide-and-evolve
inferred← citeshttps://doi.org/10.1145/2001858.2002004openalex-snapshot
Instance-based parameter tuning for evolutionary AI planning
inferred← citeshttps://doi.org/10.1145/2001858.2002053openalex-snapshot
Instance-based parameter tuning for evolutionary AI planning
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13399openalex-snapshot
An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13628openalex-snapshot
Fragment-Based Planning Using Column Generation
inferred← citeshttps://doi.org/10.2495/dman090081openalex-snapshot
AMETRINE: a humanitarian camp management system
inferred← citeshttps://doi.org/10.48550/arxiv.1305.2265openalex-snapshot
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning
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.