scientific article
From MaRDI portal
Publication:3624176
zbMATH Open1180.90166arXiv1401.3442MaRDI QIDQ3624176FDOQ3624176
Authors: Alex Gershman, Amnon Meisels, Roie Zivan
Publication date: 28 April 2009
Full work available at URL: https://arxiv.org/abs/1401.3442
Title of this publication is not available (Why is that?)
Recommendations
- Concurrent forward bounding for distributed constraint optimization problems
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Asynchronous distributed execution of fixpoint-based computational fields
- Interval consistency of asynchronous distributed computations
- scientific article; zbMATH DE number 2084769
- Two lower bounds in asynchronous distributed computation
- Publication:4939280
- scientific article; zbMATH DE number 934535
- scientific article; zbMATH DE number 3994384
Cited In (20)
- Completeness and performance of the APO algorithm
- BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm
- Proactive Dynamic Distributed Constraint Optimization Problems
- Bounded approximate decentralised coordination via the max-sum algorithm
- Adopt: asynchronous distributed constraint optimization with quality guarantees
- Concurrent search for distributed CSPs
- PC-SyncBB: a privacy preserving collusion secure DCOP algorithm
- Probabilistic optimal solution assessment for DCOPs
- A distributed optimization method for the geographically distributed data centres problem
- Asynchronous breadth-first search DCOP algorithm
- An improved distributed constraint optimization algorithm \(\text{MULBS}^+\)
- IDB-ADOPT: A Depth-First Search DCOP Algorithm
- Distributed Bayesian: A Continuous Distributed Constraint Optimization Problem Solver
- Forward bounding on pseudo-trees for DCOPs and ADCOPs
- Nogood-based asynchronous forward checking algorithms
- Governing convergence of Max-sum on DCOPs through damping and splitting
- Asynchronous forward-checking for DisCSPs
- Explorative anytime local search for distributed constraint optimization
- Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
- Solving distributed constraint optimization problems using logic programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624176)