Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Traditional approaches to combining classifiers attempt to improve classification accuracy at the cost of increased processing. They may be viewed as providing an accuracy-speed tr...
Kumar Chellapilla, Michael Shilman, Patrice Simard