Olivier Bailleux
Title
Cited by
Cited by
Year
Efficient CNF encoding of boolean cardinality constraints
O Bailleux, Y Boufkhad
International conference on principles and practice of constraint …, 2003
3292003
New encodings of pseudo-boolean constraints into CNF
O Bailleux, Y Boufkhad, O Roussel
International Conference on Theory and Applications of Satisfiability …, 2009
982009
A translation of pseudo-boolean constraints to SAT
O Bailleux, Y Boufkhad, O Roussel
Journal on Satisfiability, Boolean Modeling and Computation 2 (1-4), 191-200, 2006
952006
On the locality of distributed sparse spanner construction
B Derbel, C Gavoille, D Peleg, L Viennot
Proceedings of the twenty-seventh ACM symposium on Principles of distributed …, 2008
492008
A new universal cellular automaton discovered by evolutionary algorithms
E Sapin, O Bailleux, JJ Chabrier, P Collet
Genetic and Evolutionary Computation Conference, 175-187, 2004
442004
Research of a cellular automaton simulating logic gates by evolutionary algorithms
E Sapin, O Bailleux, C Jean-Jacques
European Conference on Genetic Programming, 414-423, 2003
402003
DISTANCE-SAT: complexity and algorithms
O Bailleux, P Marquis
AAAI/IAAI, 642-647, 1999
311999
Demonstration of the Universality of a New Cellular Automaton.
E Sapin, O Bailleux, JJ Chabrier, P Collet
International Journal of Unconventional Computing 3 (2), 2007
232007
Research of complexity in cellular automata through evolutionary algorithms
E Sapin, O Bailleux, J Chabrier
Complex systems 17 (3), 231-242, 2007
222007
Research of complexity in cellular automata through evolutionary algorithms
E Sapin, O Bailleux, J Chabrier
Complex systems 17 (3), 231-242, 2007
222007
Research of complex forms in cellular automata by evolutionary algorithms
E Sapin, O Bailleux, JJ Chabrier
International Conference on Artificial Evolution (Evolution Artificielle …, 2003
222003
Full CNF Encoding: The Counting Constraints Case.
O Bailleux, Y Boufkhad
SAT, 2, 2004
192004
Some Computational Aspects of distance-sat
O Bailleux, P Marquis
Journal of Automated Reasoning 37 (4), 231-260, 2006
132006
Approximate resolution of hard numbering problems
O Bailleux, JJ Chabrier
AAAI/IAAI, Vol. 1, 169-174, 1996
131996
Measuring the spatial dispersion of evolutionary search processes: Application to walksat
A Sidaner, O Bailleux, JJ Chabrier
International Conference on Artificial Evolution (Evolution Artificielle), 77-87, 2001
112001
Measuring the spatial dispersion of evolutionary search processes: Application to walksat
A Sidaner, O Bailleux, JJ Chabrier
International Conference on Artificial Evolution (Evolution Artificielle), 77-87, 2001
112001
On the CNF encoding of cardinality constraints and beyond
O Bailleux
arXiv preprint arXiv:1012.3853, 2010
62010
Local search for statistical counting
O Bailleux
AAAI/IAAI, 386-391, 1998
51998
Boolvar/pb v1. 0, a java library for translating pseudo-boolean constraints into cnf formulae
O Bailleux
arXiv preprint arXiv:1103.3954, 2011
42011
Counting by statistics on search trees: Application to constraint satisfaction problems
O Bailleux, JJ Chabrier
Intelligent Data Analysis 1 (1-4), 263-274, 1997
41997
The system can't perform the operation now. Try again later.
Articles 1–20