On the public citation graph

DUCT

0 signed · 49 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.1001/archderm.1952.01530250095013openalex-snapshot
Fixed drug eruption and epididymitis due to antipyrine.
inferredcites →https://doi.org/10.1007/11871842_29openalex-snapshot
Bandit Based Monte-Carlo Planning
inferredcites →https://doi.org/10.1007/11889205_56openalex-snapshot
A New Algorithm for Sampling CSP Solutions Uniformly at Random
inferredcites →https://doi.org/10.1007/978-0-387-30165-5_30openalex-snapshot
Graph Domination, Coloring and Cliques in Telecommunications
inferredcites →https://doi.org/10.1007/978-1-4615-0363-7_11openalex-snapshot
Distributed Coordination through Anarchic Optimization
inferredcites →https://doi.org/10.1007/978-1-4615-0363-7_13openalex-snapshot
A Comparative Study of Distributed Constraint Algorithms
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.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/s1574-6526(06)80011-8openalex-snapshot
Tractable Structures for Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1017/cbo9780511546921openalex-snapshot
Prediction, Learning, and Games
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1038/nature16961openalex-snapshot
Mastering the game of Go with deep neural networks and tree search
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/1082473.1082631openalex-snapshot
Preprocessing techniques for accelerating the DCOP algorithm ADOPT
inferredcites →https://doi.org/10.1609/aaai.v25i1.7812openalex-snapshot
Distributed Constraint Optimization Under Stochastic Uncertainty
inferredcites →https://doi.org/10.1609/aaai.v26i1.8129openalex-snapshot
DUCT: An Upper Confidence Bound Approach to Distributed Constraint Optimization Problems
inferredcites →https://doi.org/10.48550/arxiv.1408.2028openalex-snapshot
Bandit Algorithms for Tree Search
inferredcites →https://doi.org/10.52202/085713openalex-snapshot
Advances in Neural Information Processing Systems 19
inferredcites →https://doi.org/10.5555/1036843.1036858openalex-snapshot
Mixtures of deterministic-probabilistic networks and their AND/OR search space
inferredcites →https://doi.org/10.5555/1953048.2021053openalex-snapshot
X-Armed Bandits
inferredcites →https://doi.org/10.5555/2484920.2484950openalex-snapshot
Distributed Gibbs: a memory-bounded sampling-based DCOP algorithm
inferredcites →https://doi.org/10.65109/chlg9257openalex-snapshot
DCOPs and bandits: exploration and exploitation in decentralised coordination

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10458-018-9395-yopenalex-snapshot
A class of iterative refined Max-sum algorithms via non-consecutive value propagation strategies
inferred← citeshttps://doi.org/10.1007/s10458-020-09464-9openalex-snapshot
A genetic algorithm based framework for local search algorithms for distributed constraint optimization problems
inferred← citeshttps://doi.org/10.1007/s10458-020-09476-5openalex-snapshot
A hybrid tree-based algorithm to solve asymmetric distributed constraint optimization problems
inferred← citeshttps://doi.org/10.1007/s10458-021-09511-zopenalex-snapshot
Utility distribution matters: enabling fast belief propagation for multi-agent optimization with dense local utility function
inferred← citeshttps://doi.org/10.1007/s10458-024-09636-xopenalex-snapshot
Differentially private multi-agent constraint optimization
inferred← citeshttps://doi.org/10.1007/s10489-022-03992-5openalex-snapshot
Learning heuristics for weighted CSPs through deep reinforcement learning
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103501openalex-snapshot
PC-SyncBB: A privacy preserving collusion secure DCOP algorithm
inferred← citeshttps://doi.org/10.1088/1742-6596/2361/1/012022openalex-snapshot
Numerical Analysis of the Effect of Ducted Propeller Configuration Parameters on Aerodynamic Performance
inferred← citeshttps://doi.org/10.1109/ccnc46108.2020.9045189openalex-snapshot
Distributed Wireless Network Optimization With Stochastic Local Search
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys60770.2023.00080openalex-snapshot
TPMARL-MSS Thought-Perception Multi-Agent Reinforcement Learning Meeting Scheduling System
inferred← citeshttps://doi.org/10.1109/icedme50972.2020.00164openalex-snapshot
A Framework based on Genetic Algorithms for Distributed Constraint Optimization Problems
inferred← citeshttps://doi.org/10.1109/ijcnn54540.2023.10191732openalex-snapshot
Pretrained Parameter Configurator for Large Neighborhood Search to Solve Weighted Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796732openalex-snapshot
AoI-minimal UAV Crowdsensing by Model-based Graph Convolutional Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/scc53864.2021.00040openalex-snapshot
Distributed Service Composition in Internet of Services
inferred← citeshttps://doi.org/10.1142/s0218001422590066openalex-snapshot
VLSs: A Local Search Algorithm for Distributed Constraint Optimization Problems
inferred← citeshttps://doi.org/10.1142/s0218001423590139openalex-snapshot
An Adaptive Ant Colony Algorithm Based on Local Information Entropy to Solve Distributed Constraint Optimization Problems
inferred← citeshttps://doi.org/10.1145/3175502.3175506openalex-snapshot
AI buzzwords explained
inferred← citeshttps://doi.org/10.1145/3706059openalex-snapshot
A Green Multi-Attribute Client Selection for Over-The-Air Federated Learning: A Grey-Wolf-Optimizer Approach
inferred← citeshttps://doi.org/10.1155/2022/8003887openalex-snapshot
A GNN‐Based Variable Partition Framework for DCOPs
inferred← citeshttps://doi.org/10.14778/3675034.3675043openalex-snapshot
D-Bot: Database Diagnosis System using Large Language Models
inferred← citeshttps://doi.org/10.1613/jair.1.14151openalex-snapshot
Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver
inferred← citeshttps://doi.org/10.24963/ijcai.2021/18openalex-snapshot
Improving Multi-agent Coordination by Learning to Estimate Contention
inferred← citeshttps://doi.org/10.48550/arxiv.2009.01625openalex-snapshot
On Population-Based Algorithms for Distributed Constraint Optimization Problems
inferred← citeshttps://doi.org/10.65109/egfm7299openalex-snapshot
A Near-Optimal Node-to-Agent Mapping Heuristic for GDL-Based DCOP Algorithms in Multi-Agent Systems
inferred← citeshttps://doi.org/10.70675/559a41b6z1958z414dzb4fcz75d63c9f16aaopenalex-snapshot
Implementation of a cooperative communication within a fleet of connected and autonomous vehicles
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.