Nogood-based asynchronous forward checking algorithms

DOI10.1007/s10601-013-9144-4zbMath1327.90113OpenAlexW1996453779MaRDI QIDQ481712

Mohamed Wahbi, Christian Bessiere, Redouane Ezzahir, El Houssine Bouyakhf

Publication date: 12 December 2014

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-013-9144-4

zbMATH Keywords

search algorithmsdistributed constraint reasoning

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (1)

A distributed optimization method for the geographically distributed data centres problem

Uses Software

• DisChoco
• SensorDCSP

Cites Work

• Unnamed Item
• Unnamed Item
• Dynamic ordering for asynchronous backtracking on DisCSPs
• Message delay and DisCSP search algorithms
• Asynchronous forward-checking for DisCSPs
• New methods for high-dimensional verified quadrature
• Asynchronous backtracking without adding links: a new member in the ABT family
• Asynchronous aggregation and consistency in distributed constraint satisfaction
• Sensor networks and distributed CSP: communication, computation and complexity
• Fault-tolerant distributed algorithm for election in complete networks
• BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
• Improving ABT Performance by Adding Synchronization Points
• Recent Advances in Constraints
• Recent Advances in Constraints

This page was built for publication: Nogood-based asynchronous forward checking algorithms