On the public citation graph
Completeness and Performance Of The APO Algorithm
0 signed · 43 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-60299-2_6openalex-snapshot
Asynchronous weak-commitment search for solving distributed constraint satisfaction problems
inferredcites →https://doi.org/10.1007/978-3-540-74970-7_53openalex-snapshot
Min-Domain Ordering for Asynchronous Backtracking
inferredcites →https://doi.org/10.1007/bfb0017442openalex-snapshot
Distributed partial constraint satisfaction problem
inferredcites →https://doi.org/10.1007/s10472-006-9033-2openalex-snapshot
Message delay and DisCSP search algorithms
inferredcites →https://doi.org/10.1007/s10601-006-9013-5openalex-snapshot
Asynchronous Forward-checking for DisCSPs
inferredcites →https://doi.org/10.1016/0004-3702(95)00048-8openalex-snapshot
An empirical study of phase transitions in binary constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(95)00052-6openalex-snapshot
Locating the phase transition in binary constraint satisfaction problems
inferredcites →https://doi.org/10.1016/j.artint.2004.05.004openalex-snapshot
Solving weighted CSP by maintaining arc consistency
inferredcites →https://doi.org/10.1016/j.artint.2004.09.003openalex-snapshot
Adopt: asynchronous distributed constraint optimization with quality guarantees
inferredcites →https://doi.org/10.1016/j.artint.2004.10.002openalex-snapshot
Asynchronous backtracking without adding links: a new member in the ABT family
inferredcites →https://doi.org/10.1016/j.artint.2004.10.004openalex-snapshot
Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
inferredcites →https://doi.org/10.1016/j.artint.2005.12.005openalex-snapshot
Concurrent search for distributed CSPs
inferredcites →https://doi.org/10.1023/a:1010078712316openalex-snapshot
Algorithms for Distributed Constraint Satisfaction: A Review
inferredcites →https://doi.org/10.1109/69.729707openalex-snapshot
The distributed constraint satisfaction problem: formalization and algorithms
inferredcites →https://doi.org/10.1109/aamas.2004.249openalex-snapshot
Solving Distributed Constraint Optimization Problems Using Cooperative Mediation
inferredcites →https://doi.org/10.1109/iat.2007.14openalex-snapshot
CompAPO: A Complete Version of the APO Algorithm
inferredcites →https://doi.org/10.1109/iat.2007.39openalex-snapshot
Agent-based Fault Detection Mechanism in Wireless Sensor Networks
inferredcites →https://doi.org/10.1145/1160633.1160896openalex-snapshot
Examining DCSP coordination tradeoffs
inferredcites →https://doi.org/10.1613/jair.1786openalex-snapshot
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4179openalex-snapshot
A colored Petri net model for DisCSP algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-66412-1_2openalex-snapshot
Decentralised Control of Intelligent Devices: A Healthcare Facility Study
inferred← citeshttps://doi.org/10.1007/978-3-642-25920-3_3openalex-snapshot
Solving Distributed CSPs Using Dynamic, Partial Centralization without Explicit Constraint Passing
inferred← citeshttps://doi.org/10.1007/s00521-018-3779-4openalex-snapshot
Research on algorithm for solving maximum independent set of semi-external data of large graph data
inferred← citeshttps://doi.org/10.1007/s10489-014-0532-2openalex-snapshot
Multi-variable distributed backtracking with sessions
inferred← citeshttps://doi.org/10.1007/s10489-017-0905-4openalex-snapshot
An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimization
inferred← citeshttps://doi.org/10.1016/j.artint.2012.09.002openalex-snapshot
Concurrent forward bounding for distributed constraint optimization problems
inferred← citeshttps://doi.org/10.1016/j.artint.2014.03.002openalex-snapshot
Explorative anytime local search for distributed constraint optimization
inferred← citeshttps://doi.org/10.1016/j.artint.2018.08.002openalex-snapshot
Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103916openalex-snapshot
Privacy preserving solution of DCOPs by mediation
inferred← citeshttps://doi.org/10.1016/j.oceaneng.2026.126535openalex-snapshot
Partially centralized coordination method for collision avoidance of multiple ships via mediation
inferred← citeshttps://doi.org/10.1109/wi-iat.2012.100openalex-snapshot
Improving Asynchronous Partial Overlay
inferred← citeshttps://doi.org/10.1155/2018/8519695openalex-snapshot
Sedimentary Environment Analysis by Grain-Size Data Based on Mini Batch K-Means Algorithm
inferred← citeshttps://doi.org/10.1613/jair.3945openalex-snapshot
Asymmetric Distributed Constraint Optimization Problems
inferred← citeshttps://doi.org/10.1613/jair.3983openalex-snapshot
Protecting Privacy through Distributed Computation in Multi-agent Decision Making
inferred← citeshttps://doi.org/10.1613/jair.5322openalex-snapshot
P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm
inferred← citeshttps://doi.org/10.1613/jair.5565openalex-snapshot
Distributed Constraint Optimization Problems and Applications: A Survey
inferred← citeshttps://doi.org/10.3233/mgs-2012-0191openalex-snapshot
Improving the privacy of the asynchronous partial overlay protocol
inferred← citeshttps://doi.org/10.5220/0003752203800386openalex-snapshot
WHEN YOU SAY (DCOP) PRIVACY, WHAT DO YOU MEAN? - Categorization of DCOP Privacy and Insights on Internal Constraint Privacy
inferred← citeshttps://doi.org/10.5555/1838206.1838414openalex-snapshot
Asynchronous partitioning framework
inferred← citeshttps://doi.org/10.5555/2484920.2485152openalex-snapshot
Distributed problem solving in geometrically-structured constraint networks
inferred← citeshttps://doi.org/10.5555/2615731.2617391openalex-snapshot
A privacy-preserving algorithm for distributed constraint optimization
inferred← citeshttps://doi.org/10.70675/d0b534a1za38dz4011zabf3zaa293db5fe43openalex-snapshot
Decentralised congestion control mechanisms for autonomous vehicles using distributed constraints optimisation
inferred← citeshttps://doi.org/10.7275/smq4-z028openalex-snapshot
Exploiting Domain Structure in Multiagent Decision-Theoretic Planning and Reasoning
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.