On the public citation graph

Multiple-Goal Heuristic Search

0 signed · 46 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-45655-4_36openalex-snapshot
Using PageRank to Characterize Web Structure
inferredcites →https://doi.org/10.1007/bf00993063openalex-snapshot
Machine Discovery of Effective Admissible Heuristics
inferredcites →https://doi.org/10.1016/0004-3702(94)90054-xopenalex-snapshot
Deliberation scheduling for problem solving in time-constrained environments
inferredcites →https://doi.org/10.1016/0306-4573(88)90021-0openalex-snapshot
Term-weighting approaches in automatic text retrieval
inferredcites →https://doi.org/10.1016/b978-0-934613-64-4.50017-7openalex-snapshot
ID5: An Incremental ID3
inferredcites →https://doi.org/10.1016/s0004-3702(01)00092-3openalex-snapshot
Disjoint pattern database heuristics
inferredcites →https://doi.org/10.1016/s0169-7552(98)00108-1openalex-snapshot
Efficient crawling through URL ordering
inferredcites →https://doi.org/10.1016/s0169-7552(98)00110-xopenalex-snapshot
The anatomy of a large-scale hypertextual Web search engine
inferredcites →https://doi.org/10.1016/s0169-7552(98)00127-5openalex-snapshot
A technique for measuring the relative size and overlap of public Web search engines
inferredcites →https://doi.org/10.1016/s1389-1286(00)00063-3openalex-snapshot
WebBase: a repository of Web pages
inferredcites →https://doi.org/10.1016/s1389-1286(99)00052-3openalex-snapshot
Focused crawling: a new approach to topic-specific Web resource discovery
inferredcites →https://doi.org/10.1080/15427951.2006.10129114openalex-snapshot
Using PageRank to Characterize Web Structure
inferredcites →https://doi.org/10.1109/tai.2003.1250221openalex-snapshot
Sweep A: space-efficient heuristic search in partially ordered graphs
inferredcites →https://doi.org/10.1109/tit.1967.1053964openalex-snapshot
Nearest neighbor pattern classification
inferredcites →https://doi.org/10.1109/tpami.1982.4767270openalex-snapshot
Studies in Semi-Admissible Heuristics
inferredcites →https://doi.org/10.1145/324133.324140openalex-snapshot
Authoritative sources in a hyperlinked environment
inferredcites →https://doi.org/10.1145/335168.335170openalex-snapshot
The Web as a graph
inferredcites →https://doi.org/10.1145/371920.371965openalex-snapshot
Breadth-first crawling yields high-quality pages
inferredcites →https://doi.org/10.1145/371920.372096openalex-snapshot
Finding authorities and hubs from link structures on the World Wide Web
inferredcites →https://doi.org/10.1145/383952.383995openalex-snapshot
Evaluating topic-driven web crawlers
inferredcites →https://doi.org/10.1145/509907.509970openalex-snapshot
Crawling on web graphs
inferredcites →https://doi.org/10.1287/opre.18.6.1138openalex-snapshot
The Traveling-Salesman Problem and Minimum Spanning Trees
inferredcites →https://doi.org/10.1609/aimag.v17i3.1232openalex-snapshot
Using anytime algorithms in intelligent systems
inferredcites →https://doi.org/10.1613/jair.1534openalex-snapshot
An Improved Search Algorithm for Optimal Multiple-Sequence Alignment
inferredcites →https://doi.org/10.2307/1271458openalex-snapshot
Design and Analysis of Experiments
inferredcites →https://doi.org/10.2307/2288003openalex-snapshot
Classification and Regression Trees.
inferredcites →https://doi.org/10.2307/2530946openalex-snapshot
Classification and Regression Trees.
inferredcites →https://doi.org/10.3929/ethz-a-001419966openalex-snapshot
Harnessing computational resources for efficient exhaustive search
inferredcites →https://doi.org/10.5555/314613.315045openalex-snapshot
Authoritative sources in a hyperlinked environment
inferredcites →https://doi.org/10.5555/777092.777250openalex-snapshot
Multiple sequence alignment using anytime A
inferredcites →https://doi.org/10.5860/choice.33-1577openalex-snapshot
Artificial intelligence: a modern approach

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-642-15810-0_45openalex-snapshot
Frontier Based Multiple Goal Search in Unknown Environments
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103217openalex-snapshot
Landmark-based approaches for goal recognition as planning
inferred← citeshttps://doi.org/10.1016/j.solener.2021.07.070openalex-snapshot
A non-intrusive optical approach to characterize heliostats in utility-scale power tower plants: Flight path generation/optimization of unmanned aerial systems
inferred← citeshttps://doi.org/10.1109/ecmr.2019.8870971openalex-snapshot
Robot Path Planning for Multiple Target Regions
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2010.00364.xopenalex-snapshot
HEURISTIC SEARCH UNDER CONTRACT
inferred← citeshttps://doi.org/10.15607/rss.2015.xi.045openalex-snapshot
Dealing with Difficult Instances of Object Rearrangement
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.9815openalex-snapshot
Integrating Planning and Recognition to Close the Interaction Loop
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11188openalex-snapshot
Integration of Planning with Recognition for Responsive Interaction Using Classical Planners
inferred← citeshttps://doi.org/10.1609/socs.v5i1.18334openalex-snapshot
Improved Heuristic Search for Sparse Motion Planning Data Structures
inferred← citeshttps://doi.org/10.1613/jair.2096openalex-snapshot
Anytime Heuristic Search
inferred← citeshttps://doi.org/10.2514/1.i010484openalex-snapshot
Energy-Aware Multiflight Planning for an Unattended Seaplane: Flying Fish
inferred← citeshttps://doi.org/10.3390/computers14120545openalex-snapshot
Time and Memory Trade-Offs in Shortest-Path Algorithms Across Graph Topologies: A*, Bellman–Ford, Dijkstra, AI-Augmented A* and a Neural Baseline
inferred← citeshttps://doi.org/10.48550/arxiv.2005.05712openalex-snapshot
Goal Recognition over Imperfect Domain Models
inferred← citeshttps://doi.org/10.5555/1838206.1838350openalex-snapshot
Multi-target adaptive A*
inferred← citeshttps://doi.org/10.5753/sbes.2024.3363openalex-snapshot
Iterative Deepening URL-Based Search: Enhancing GUI Testing for Web Applications
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.