Travelled to:1 × Belgium
1 × Finland
1 × Italy
1 × Korea
1 × Portugal
2 × USA
Collaborated with:F.Bacchus A.Sabharwal M.Sellmann L.Bordeaux C.Reddy Y.Malitsky T.Schrijvers G.Tack P.Wuille P.J.Stuckey B.Bloom D.Grove B.Herta V.A.Saraswat
Talks about:sat (3) portfolio (2) framework (2) algorithm (2) qbf (2) constraint (1) satisfact (1) introduct (1) stochast (1) parallel (1)
Person: Horst Samulowitz
DBLP: Samulowitz:Horst
Contributed to:
2013
201220122011
200720072006Wrote 9 papers:
- SAT-2013-SamulowitzRSS #algorithm #named
- Snappy: A Simple Algorithm Portfolio (HS, CR, AS, MS), pp. 422–428.
- LOPSTR-2012-SchrijversTWSS #combinator
- An Introduction to Search Combinators (TS, GT, PW, HS, PJS), pp. 2–16.
- SAT-2012-BloomGHSSS #framework #game studies #named #parallel #satisfiability #scalability
- SatX10: A Scalable Plug&Play Parallel SAT Framework — (BB, DG, BH, AS, HS, VAS), pp. 463–468.
- SAT-2011-MalitskySSS #algorithm #satisfiability
- Non-Model-Based Algorithm Portfolios for SAT (YM, AS, HS, MS), pp. 369–370.
- SAC-2007-BordeauxS #constraints #framework #on the #probability
- On the stochastic constraint satisfaction framework (LB, HS), pp. 316–320.
- SAT-2007-SamulowitzB #clustering
- Dynamically Partitioning for Solving QBF (HS, FB), pp. 215–229.
- SAT-2006-SamulowitzB #reasoning
- Binary Clause Reasoning in QBF (HS, FB), pp. 353–367.