CP
2011
Springer
13 years 7 days ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...
IPPS
2005
IEEE
14 years 6 months ago
2005
IEEE
We propose a new self-stabilizing anonymous leader election algorithm in a tree graph. We show the correctness of the protocol and show that the protocol terminates in O(n4 ) time...