Adopt: asynchronous distributed constraint optimization with quality guarantees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1573293 (Why is no real title available?)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 4112072 (Why is no real title available?)
- scientific article; zbMATH DE number 67481 (Why is no real title available?)
- scientific article; zbMATH DE number 2083800 (Why is no real title available?)
- Depth-first iterative-deepening: An optimal admissible tree search
- Self-stabilizing depth-first search
Cited in
(42)- BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
- Real-time supply chain control via multi-agent adjustable autonomy
- Proactive Dynamic Distributed Constraint Optimization Problems
- An efficient distributed optimization and coordination protocol: application to the emergency vehicle management
- A framework for parallel and distributed training of neural networks
- Bounded approximate decentralised coordination via the max-sum algorithm
- On the computational complexity of coalitional resource games
- Adding laziness in BnB-ADOPT\(^+\)
- Privacy preserving solution of DCOPs by mediation
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Probabilistic optimal solution assessment for DCOPs
- COOPT: using collective behavior of coupled oscillators for solving DCOP
- Decentralized, decomposition-based observation scheduling for a large-scale satellite constellation
- Group planning with time constraints
- Communication-Aware Local Search for Distributed Constraint Optimization
- A distributed optimization method for the geographically distributed data centres problem
- Cluster tree elimination for distributed constraint optimization with quality guarantees
- Asynchronous breadth-first search DCOP algorithm
- IDB-ADOPT: A Depth-First Search DCOP Algorithm
- A cooperative optimization algorithm inspired by chaos-order transition
- Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver
- Forward bounding on pseudo-trees for DCOPs and ADCOPs
- An overview of parallel SAT solving
- Governing convergence of Max-sum on DCOPs through damping and splitting
- Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems
- Incentive-based search for equilibria in Boolean games
- Concurrent forward bounding for distributed constraint optimization problems
- Scheduling of Earth observing satellites using distributed constraint optimization
- Counterexamples and amendments to the termination and optimality of ADOPT-based algorithms
- Soft agents: exploring soft constraints to model robust adaptive distributed cyber-physical agent systems
- Solving constrained optimization problems using probability collectives and a penalty function approach
- Explorative anytime local search for distributed constraint optimization
- Privacy stochastic games in distributed constraint reasoning
- Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
- Multiagent cooperation for solving global optimization problems: an extendible framework with example cooperation strategies
- AND/OR search spaces for graphical models
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Connecting BnB-ADOPT with soft arc consistency: initial results
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
- Asymmetric distributed constraint optimization problems
- A dual-population search differential evolution algorithm for functional distributed constraint optimization problems
- Solving distributed constraint optimization problems using logic programming
This page was built for publication: Adopt: asynchronous distributed constraint optimization with quality guarantees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457704)
