Distributed constraint satisfaction with partially known constraints

DOI10.1007/s10601-008-9048-xzbMath1186.68434OpenAlexW2097489639MaRDI QIDQ842788

Amnon Meisels, Pedro Meseguer, Roie Zivan, Ismel Brito

Publication date: 25 September 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9048-x

zbMATH Keywords

entropyprivacyasynchronous searchdistributed CSPs

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Concurrent forward bounding for distributed constraint optimization problems ⋮ Forward bounding on pseudo-trees for DCOPs and ADCOPs ⋮ A distributed optimization method for the geographically distributed data centres problem ⋮ Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts

Uses Software

• CSPLib

Cites Work

• Dynamic ordering for asynchronous backtracking on DisCSPs
• Message delay and DisCSP search algorithms
• Asynchronous backtracking without adding links: a new member in the ABT family
• Secure distributed constraint satisfaction: reaching agreement without revealing private information
• Distributed Stable Matching Problems
• Time, clocks, and the ordering of events in a distributed system
• Elements of Information Theory

This page was built for publication: Distributed constraint satisfaction with partially known constraints