On the public citation graph
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
0 signed · 38 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-45578-7_73openalex-snapshot
Distributed Dynamic Backtracking
inferredcites →https://doi.org/10.1007/3-540-59479-5_24openalex-snapshot
Using bidirectionality to speed up arc-consistency processing
inferredcites →https://doi.org/10.1007/3-540-60299-2_16openalex-snapshot
Dynamic variable ordering in CSPs
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/3-540-61551-2_116openalex-snapshot
Modeling and solving distributed constraint satisfaction problems (DCSPs)
inferredcites →https://doi.org/10.1007/3-540-61551-2_74openalex-snapshot
An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_70openalex-snapshot
Synchronous, Asynchronous and Hybrid Algorithms for DisCSP
inferredcites →https://doi.org/10.1007/978-3-642-59546-2_2openalex-snapshot
Distributed 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.1016/0004-3702(80)90051-xopenalex-snapshot
Increasing tree search efficiency for constraint satisfaction problems
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.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.003openalex-snapshot
Asynchronous aggregation and consistency in distributed constraint satisfaction
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.1111/j.1467-8640.1993.tb00310.xopenalex-snapshot
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11766247_14openalex-snapshot
Simple Support-Based Distributed Search
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_53openalex-snapshot
Min-Domain Ordering for Asynchronous Backtracking
inferred← citeshttps://doi.org/10.1007/s10458-008-9069-2openalex-snapshot
ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking
inferred← citeshttps://doi.org/10.1007/s10601-008-9046-zopenalex-snapshot
Min-domain retroactive ordering for Asynchronous Backtracking
inferred← citeshttps://doi.org/10.1007/s10601-019-09304-yopenalex-snapshot
Incentive-based search for equilibria in boolean games
inferred← citeshttps://doi.org/10.1007/s44230-023-00044-0openalex-snapshot
Distributed Multi-Agent Hierarchy Construction for Dynamic DCOPs in Mobile Sensor Teams
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/s1574-6526(06)80024-6openalex-snapshot
Distributed Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1093/comjnl/bxt088openalex-snapshot
Global Constraints in Distributed Constraint Satisfaction and Optimization
inferred← citeshttps://doi.org/10.1109/iat.2006.68openalex-snapshot
Framework for Modeling Reordering Heuristics for Asynchronous Backtracking
inferred← citeshttps://doi.org/10.1109/snpd.2008.171openalex-snapshot
Mixing Protocol based on the Cooperation and the Parallelism for the Distributed Environment
inferred← citeshttps://doi.org/10.1145/1160633.1160896openalex-snapshot
Examining DCSP coordination tradeoffs
inferred← citeshttps://doi.org/10.12694/scpe.v13i1.767openalex-snapshot
The effect of temporary links in randomly generated networks of constraints
inferred← citeshttps://doi.org/10.1613/jair.5456openalex-snapshot
AND/OR Branch-and-Bound on a Computational Grid
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.