Improving ABT Performance by Adding Synchronization Points

DOI10.1007/978-3-540-89812-2_4MaRDI QIDQ5302724zbMATH OpenOpenAlexFDO

Authors Ismel Brito, P. Meseguer

Publication date 13 January 2009

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

Full work available at URL https://doi.org/10.1007/978-3-540-89812-2_4

Mathematics Subject Classification ID

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

Recommendations

• Asynchronous backtracking without adding links: a new member in the ABT family
• scientific article; zbMATH DE number 2084711
• Dynamic ordering for asynchronous backtracking on DisCSPs
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems

Cites work

• Asynchronous backtracking without adding links: a new member in the ABT family
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Network-based heuristics for constraint-satisfaction problems

Cited in

(6)

• Asynchronous backtracking without adding links: a new member in the ABT family
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• scientific article; zbMATH DE number 2084711 (Why is no real title available?)
• Nogood-based asynchronous forward checking algorithms
• Corrigendum to: ``Min-domain retroactive ordering for asynchronous backtracking
• Dynamic ordering for asynchronous backtracking on DisCSPs

This page was built for publication: Improving ABT Performance by Adding Synchronization Points

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