Jacqueline Chabrier

Learn More
This paper presents an evolutionary approach to searching for cellular automata that accept gliders. The proposed technique is based on a specific fitness function taking into account spatial evolution, the number of living cells, and the presence of gliders. The results show that the genetic algorithm is a promising tool for finding cellular automata with(More)
Many satisfiability problems called structured SAT problems (like Ramsey, PigeonHole , and so on) may be very shortly defined with Score(FD/B), a boolean constraint programming language design at the Computer Research Center of Dijon (CRID). In addition to the expressiveness, design features of the language (cardinality constraints) are also used to detect(More)
Many satissability problems called structured SAT problems (like Ramsey, PigeonHole, and so on) may be very shortly deened with Score(FD/B), a boolean constraint programming language design at the Computer Research Center of Dijon (CRID). In addition to the expressiveness, design features of the language (cardinality constraints) are also used to detect(More)
  • 1