The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
In mobile wireless sensor networks, sensors move in the monitored area at any direction and at any speed. Unlike many other networking hosts, sensor nodes do not have global addres...
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...
- Besides the difficulty of the application problem to be solved with Genetic Algorithms (GAs), an additional difficulty arises because the quality of the solution found, or the ...