Precedence constraints play a crucial role in planning and scheduling problems. Many real-life problems also include dependency constraints expressing logical relations between the...
Estimation of Distribution Algorithms (EDAs) are new promising methods in the field of genetic and evolutionary algorithms. In the case of conventional Genetic and Evolutionary Al...
In this paper, we consider algorithms for distributed constraint optimisation problems (DCOPs). Using a potential game characterisation of DCOPs, we decompose six distributed DCOP...
Archie C. Chapman, Alex Rogers, Nicholas R. Jennin...
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
Learning during backtrack search is a space-intensive process that records information (such as additional constraints) in order to avoid redundant work. In this paper, we analyze...