On the public citation graph
Removing Redundant Messages in N-ary BnB-ADOPT
0 signed · 21 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/bfb0017442openalex-snapshot
Distributed partial constraint satisfaction problem
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.1109/69.729707openalex-snapshot
The distributed constraint satisfaction problem: formalization and algorithms
inferredcites →https://doi.org/10.1109/aamas.2004.257openalex-snapshot
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
inferredcites →https://doi.org/10.1145/1160633.1160900openalex-snapshot
No-commitment branch and bound search for distributed constraint optimization
inferredcites →https://doi.org/10.1609/aaai.v24i1.7552openalex-snapshot
Coalition Structure Generation based on Distributed Constraint Optimization
inferredcites →https://doi.org/10.1609/aaai.v24i1.7768openalex-snapshot
Saving Redundant Messages in BnB-ADOPT
inferredcites →https://doi.org/10.1613/jair.2591openalex-snapshot
Asynchronous Forward Bounding for Distributed COPs
inferredcites →https://doi.org/10.5075/epfl-thesis-3942openalex-snapshot
A class of algorithms for distributed constraint optimization
inferredcites →https://doi.org/10.5555/1402298.1402307openalex-snapshot
BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
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-40627-0_52openalex-snapshot
Asynchronous Forward Bounding Revisited
inferred← citeshttps://doi.org/10.1007/s10601-014-9177-3openalex-snapshot
Adding laziness in BnB-ADOPT+
inferred← citeshttps://doi.org/10.1017/s147106841700014xopenalex-snapshot
Solving distributed constraint optimization problems using logic programming
inferred← citeshttps://doi.org/10.1109/wi-iat.2015.114openalex-snapshot
Incremental DCOP Search Algorithms for Solving Dynamic DCOP Problems
inferred← citeshttps://doi.org/10.1109/wi-iat.2015.65openalex-snapshot
Clustering Variables by Their Agents
inferred← citeshttps://doi.org/10.12988/ijco.2018.857openalex-snapshot
Connecting AFB_BJ+ with soft arc consistency
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9365openalex-snapshot
Solving Distributed Constraint Optimization Problems Using Logic Programming
inferred← citeshttps://doi.org/10.1609/aimag.v35i3.2524openalex-snapshot
A Survey of Artificial Intelligence Research at IIIA
inferred← citeshttps://doi.org/10.1613/jair.5565openalex-snapshot
Distributed Constraint Optimization Problems and Applications: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.1705.03916openalex-snapshot
Solving Distributed Constraint Optimization Problems Using Logic Programming
inferred← citeshttps://doi.org/10.48550/arxiv.2002.10641openalex-snapshot
RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inferences
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.