This paper presents DisAC-9, the first optimal distributed algorithm performing the arc-consistency of a constraint network. Our method is optimal according to the number of messa...
— Scheduling by Edge Reversal (SER) is a fully distributed scheduling mechanism based on the manipulation of acyclic orientations of a graph. This work uses SER to perform constr...
This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of cons...
A. E. Eiben, Jano I. van Hemert, Elena Marchiori, ...
Abstract. Researchers have focused on assessing the quality of search algorithms by measuring effort, number of mistakes, runtime distributions and other characteristics. In this p...
Today's networking community is becoming increasingly skeptical of the significance of research results founded wholly upon experimental results conducted in simulation. Now, ...
Jeffrey Considine, John W. Byers, Ketan Meyer-Pate...