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, ...
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
We present a new approach to inferring a probability distribution which is incompletely specified by a number of linear constraints. We argue that the currently most popular appro...
Abstract. Constructive methods obtain solutions to constraint satisfaction problem instances by iteratively extending consistent partial assignments. In this research, we study the...
George Boukeas, Panagiotis Stamatopoulos, Constant...
Abstract—Delay-reliability (D-R), and throughput-delayreliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repe...