Travelled to:
1 × China
1 × USA
2 × Italy
Collaborated with:
L.Saïs Y.Salhi G.Audemard B.Hoessen C.Piette B.Benhamou T.Uno J.Lagniez L.Bordeaux Y.Hamadi
Talks about:
mine (3) approach (2) satisfi (2) framework (1) distribut (1) symmetri (1) proposit (1) parallel (1) conflict (1) compress (1)
Person: Saïd Jabbour
DBLP: Jabbour:Sa=iuml=d
Contributed to:
Wrote 7 papers:
- KDIR-2014-BenhamouJSS #mining #symmetry
- Symmetry Breaking in Itemset Mining (BB, SJ, LS, YS), pp. 86–96.
- PDP-2014-AudemardHJP #approach #distributed #effectiveness #problem #satisfiability
- An Effective Distributed D&C Approach for the Satisfiability Problem (GA, BH, SJ, CP), pp. 183–187.
- CIKM-2013-JabbourSS #mining #satisfiability #sequence
- Boolean satisfiability for sequence mining (SJ, LS, YS), pp. 649–658.
- CIKM-2013-JabbourSSU #approach
- Mining-based compression approach of propositional formulae (SJ, LS, YS, TU), pp. 289–298.
- SAT-2012-AudemardHJLP #parallel #satisfiability
- Revisiting Clause Exchange in Parallel SAT Solving (GA, BH, SJ, JML, CP), pp. 200–213.
- SAT-2008-AudemardBHJS #analysis #framework
- A Generalized Framework for Conflict Analysis (GA, LB, YH, SJ, LS), pp. 21–27.