On the public citation graph
Statistical Selection Among Problem-Solving Methods.
0 signed · 19 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58811-6openalex-snapshot
Planning and Learning by Analogical Reasoning
inferredcites →https://doi.org/10.1080/09528139508953801openalex-snapshot
Integrating planning and learning: the PRODIGY architecture
inferredcites →https://doi.org/10.1111/j.1467-8640.1992.tb00370.xopenalex-snapshot
USING DISTRIBUTION‐FREE LEARNING THEORY TO ANALYZE SOLUTION‐PATH CACHING MECHANISMS
inferredcites →https://doi.org/10.1201/b19097-5openalex-snapshot
Introduction to Probability and Statistics
inferredcites →https://doi.org/10.21236/ada269772openalex-snapshot
Automatically Generating Abstractions for Planning
inferredcites →https://doi.org/10.5860/choice.33-5144openalex-snapshot
Empirical methods for artificial intelligence
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10720246_5openalex-snapshot
Exploiting Competitive Planner Performance
inferred← citeshttps://doi.org/10.1007/3-540-48775-1_15openalex-snapshot
Distributed Problem Solving Environment Dedicated to DNA Sequence Annotation
inferred← citeshttps://doi.org/10.1007/978-3-319-49956-7_28openalex-snapshot
Hardware-Specific Selection the Most Fast-Running Software Components
inferred← citeshttps://doi.org/10.1007/978-3-319-50137-6_7openalex-snapshot
Algorithm Selection for Combinatorial Search Problems: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-44973-4_40openalex-snapshot
Identifying Key Algorithm Parameters and Instance Features Using Forward Selection
inferred← citeshttps://doi.org/10.1007/s10472-018-9598-6openalex-snapshot
Portfolio theorem proving and prover runtime prediction for geometry
inferred← citeshttps://doi.org/10.1016/j.artint.2005.10.009openalex-snapshot
Metacognition in computation: A selected research review
inferred← citeshttps://doi.org/10.1016/j.artint.2007.11.004openalex-snapshot
Proof planning with multiple strategies
inferred← citeshttps://doi.org/10.1016/j.ins.2012.11.014openalex-snapshot
Increasing the efficiency of quicksort using a neural network based algorithm selection model
inferred← citeshttps://doi.org/10.1609/aimag.v35i3.2460openalex-snapshot
Algorithm Selection for Combinatorial Search Problems: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7959openalex-snapshot
Algorithm Selection for Combinatorial Search Problems: A Survey
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.