Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
From MaRDI portal
Publication:2075368
DOI10.1007/s10472-021-09735-5OpenAlexW3156175301MaRDI QIDQ2075368
Marius Silaghi, René Mandiau, Julien Vion, Sylvain Piechowiak
Publication date: 14 February 2022
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-021-09735-5
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed constraint satisfaction with partially known constraints
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- A general approach for constraint solving by local search
- Privacy stochastic games in distributed constraint reasoning
- Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
- Explorative anytime local search for distributed constraint optimization
- Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks
- The distributed breakout algorithms
- Open constraint programming
- Asymmetric Distributed Constraint Optimization Problems
- Protecting Privacy through Distributed Computation in Multi-agent Decision Making
- P-SyncBB: A Privacy Preserving Branch and Bound DCOP Algorithm
- Soft Constraints of Difference and Equality
- k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
- Privacy Preserving Implementation of the Max-Sum Algorithm and its Variants
- The Smart Table Constraint
This page was built for publication: Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts
