Asynchronous aggregation and consistency in distributed constraint satisfaction

DOI10.1016/J.ARTINT.2004.10.003MaRDI QIDQ2457696zbMATH OpenOpenAlexFDO

Authors Marius Silaghi, Boi Faltings

Publication date 23 October 2007

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2004.10.003

zbMATH Keywords

constraint satisfactionmulti-agent systemsdistributed AI

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 67481 (Why is no real title available?)
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• scientific article; zbMATH DE number 2080311 (Why is no real title available?)
• scientific article; zbMATH DE number 2084775 (Why is no real title available?)
• Consistency in networks of relations
• On the parallel complexity of discrete relaxation in constraint satisfaction networks
• Time, clocks, and the ordering of events in a distributed system

Cited in

(14)

• Asynchronous constraint-based approach: new solution for any constraint problem
• Completeness and performance of the APO algorithm
• scientific article; zbMATH DE number 5547971 (Why is no real title available?)
• scientific article; zbMATH DE number 2013508 (Why is no real title available?)
• The impact of the conflict on solving distributed constraint satisfaction problems
• scientific article; zbMATH DE number 1452706 (Why is no real title available?)
• scientific article; zbMATH DE number 5547836 (Why is no real title available?)
• scientific article; zbMATH DE number 2084769 (Why is no real title available?)
• Nogood-based asynchronous forward checking algorithms
• Asynchronous forward-checking for DisCSPs
• scientific article; zbMATH DE number 2084766 (Why is no real title available?)
• Min-domain retroactive ordering for asynchronous backtracking
• Dynamic ordering for asynchronous backtracking on DisCSPs
• Message delay and DisCSP search algorithms

This page was built for publication: Asynchronous aggregation and consistency in distributed constraint satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457696)