Asynchronous search for numeric DisCSPs

DOI10.1007/3-540-45578-7_83MaRDI QIDQ4735933zbMATH OpenFDO

Authors Marius Silaghi, Stefan Sabău, Djamila Sam-Haroud, Boi Faltings

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390785.htm, http://infoscience.epfl.ch/record/98133

Mathematics Subject Classification ID

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

Recommendations

• Message delay and asynchronous DisCSP search
• Asynchronous forward-checking for DisCSPs
• Discrete asynchronous iterations
• Parallel asynchronous algorithms for discrete data
• Asynchronous resource discovery
• Asynchronous resource discovery
• Asynchronous shared memory search structures

Cited in

(5)

• Asynchronous aggregation and consistency in distributed constraint satisfaction
• Distributed personnel scheduling -- negotiation among scheduling agents
• Improving the performances of asynchronous algorithms by combining the nogood processors with the nogood learning techniques
• Asynchronous constraint-based approach: new solution for any constraint problem
• Message delay and asynchronous DisCSP search

This page was built for publication: Asynchronous search for numeric DisCSPs

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