Dynamic ordering for asynchronous backtracking on DisCSPs

DOI10.1007/s10601-006-8062-0zbMath1103.68117OpenAlexW2132101043MaRDI QIDQ850468

Roie Zivan, Amnon Meisels

Publication date: 3 November 2006

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-006-8062-0

zbMATH Keywords

SearchDistributed AIDistributed Constraint Satisfaction

Mathematics Subject Classification ID

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

Related Items (7)

Min-domain retroactive ordering for asynchronous backtracking ⋮ Distributed constraint satisfaction with partially known constraints ⋮ Concurrent forward bounding for distributed constraint optimization problems ⋮ Nogood-based asynchronous forward checking algorithms ⋮ Balancing and scheduling of flexible mixed model assembly lines ⋮ Corrigendum to: ``Min-domain retroactive ordering for asynchronous backtracking ⋮ Reordering all agents in asynchronous backtracking for distributed constraint satisfaction problems

Cites Work

• Message delay and DisCSP search algorithms
• Asynchronous forward-checking for DisCSPs
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Asynchronous backtracking without adding links: a new member in the ABT family
• Asynchronous aggregation and consistency in distributed constraint satisfaction
• Dynamic Ordering for Asynchronous Backtracking on DisCSPs
• Time, clocks, and the ordering of events in a distributed system
• Recent Advances in Constraints
• Unnamed Item
• Unnamed Item

This page was built for publication: Dynamic ordering for asynchronous backtracking on DisCSPs