Il prof. Prof. Amnon Meisels, Dept. of Computer Science della Ben-Gurion University, Beer-Sheva, Israel terrà un seminario dal titolo

Heuristic Ordering for Asynchronous Backtracking

Abstract:

Ordering heuristics are a powerful tool in centralized search and in CSP search algorithms in particular. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the min-domain property.
The talk will introduce Distributed Constraints Satisfaction (DCSP), and its first search algorithm Asynchronous Backtracking (ABT). Next, the important improvement of dynamically ordered ABT - ABT_DO - and its main ideas that enable its correctness.
Building upon the nature of asynchronous backtracking, an asynchronous dynamic ordering can be designed that does not follow the standard restrictions on the position of reordered agents in centralized and asynchronous backtracking.
Agents can be moved to a position that is higher than that of the target of the backtrack (culprit). Combining the Nogood-triggered heuristic and the min-domain property in this new class of heuristics results in the best performing version of ABT_DO.

Tutti gli interessati sono caldamente invitati a partecipare
Agostino Dovier