 | 2009 |
|---|
| 13 |       | Olivier Bailleux,
Yacine Boufkhad,
Olivier Roussel:
New Encodings of Pseudo-Boolean Constraints into CNF.
SAT 2009: 181-194 |
| 2006 |
|---|
| 12 | | Olivier Bailleux,
Pierre Marquis:
Some Computational Aspects of distance-sat.
J. Autom. Reasoning 37(4): 231-260 (2006) |
| 11 | | Olivier Bailleux,
Yacine Boufkhad,
Olivier Roussel:
A Translation of Pseudo Boolean Constraints to SAT.
JSAT 2(1-4): 191-200 (2006) |
| 2004 |
|---|
| 10 | | Emmanuel Sapin,
Olivier Bailleux,
Jean-Jacques Chabrier,
Pierre Collet:
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms.
GECCO (1) 2004: 175-187 |
| 9 | | Olivier Bailleux,
Yacine Boufkhad:
Full CNF Encoding: The Counting Constraints Case.
SAT 2004 |
| 2003 |
|---|
| 8 | | Emmanuel Sapin,
Olivier Bailleux,
Jean-Jacques Chabrier:
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms.
Artificial Evolution 2003: 357-367 |
| 7 | | Olivier Bailleux,
Yacine Boufkhad:
Efficient CNF Encoding of Boolean Cardinality Constraints.
CP 2003: 108-122 |
| 6 | | Emmanuel Sapin,
Olivier Bailleux,
Jean-Jacques Chabrier:
Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms.
EuroGP 2003: 414-423 |
| 2001 |
|---|
| 5 | | Alain Sidaner,
Olivier Bailleux,
Jean-Jacques Chabrier:
Measuring the Spatial Dispersion of Evolutionary Search Processes: Application to Walksat.
Artificial Evolution 2001: 77-90 |
| 1999 |
|---|
| 4 |  | Olivier Bailleux,
Pierre Marquis:
DISTANCE-SAT: Complexity and Algorithms.
AAAI/IAAI 1999: 642-647 |
| 1998 |
|---|
| 3 | | Olivier Bailleux:
Local Search for Statistical Counting.
AAAI/IAAI 1998: 386-391 |
| 1997 |
|---|
| 2 | | Olivier Bailleux,
Jean-Jacques Chabrier:
Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems.
Intell. Data Anal. 1(1-4): 263-274 (1997) |
| 1996 |
|---|
| 1 | | Olivier Bailleux,
Jean-Jacques Chabrier:
Approximate Resolution of Hard Numbering Problems.
AAAI/IAAI, Vol. 1 1996: 169-174 |
