Travelled to:1 × China
1 × Finland
1 × Poland
2 × Italy
2 × Portugal
2 × United Kingdom
4 × USA
Collaborated with:B.Selman C.P.Gomes L.Kroc H.Samulowitz M.Cary A.Rudra S.Ermon M.Sellmann B.N.Dilkina P.Beame H.A.Kautz C.Reddy Y.Malitsky J.Hoffmann C.Ansótegui J.W.Hart B.Bloom D.Grove B.Herta V.A.Saraswat
Talks about:sat (4) model (3) portfolio (2) algorithm (2) discret (2) between (2) search (2) metric (2) integr (2) effici (2)
Person: Ashish Sabharwal
DBLP: Sabharwal:Ashish
Contributed to:
20142013
2013201220112010
20092009
20072007200620052003Wrote 16 papers:
- ICML-c1-2014-ErmonGSS #constraints #integration
- Low-density Parity Constraints for Hashing-Based Discrete Integration (SE, CPG, AS, BS), pp. 271–279.
- ICML-c2-2013-ErmonGSS #integration #optimisation
- Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization (SE, CPG, AS, BS), pp. 334–342.
- SAT-2013-SamulowitzRSS #algorithm #named
- Snappy: A Simple Algorithm Portfolio (HS, CR, AS, MS), pp. 422–428.
- 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.
- SAT-2010-KrocSS #empirical #runtime
- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search (LK, AS, BS), pp. 346–351.
- SAC-2009-KrocSS #heuristic #message passing #satisfiability
- Message-passing and local heuristics as decimation strategies for satisfiability (LK, AS, BS), pp. 1408–1414.
- SAT-2009-DilkinaGS #learning
- Backdoors in the Context of Learning (BND, CPG, AS), pp. 73–79.
- SAT-2009-KrocSS #satisfiability
- Relaxed DPLL Search for MaxSAT (LK, AS, BS), pp. 447–452.
- ICALP-2007-CaryRS #finite #metric
- Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), p. 949.
- SAT-2007-GomesHSS #theory and practice
- Short XORs for Model Counting: From Theory to Practice (CPG, JH, AS, BS), pp. 100–106.
- SAT-2006-SabharwalAGHS #modelling #performance #symmetry
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (AS, CA, CPG, JWH, BS), pp. 382–395.
- ICALP-2005-CaryRS #finite #metric #on the
- On the Hardness of Embeddings Between Two Finite Metrics (MC, AR, AS), pp. 1412–1423.
- SAT-2003-SabharwalBK #learning #performance #problem #using
- Using Problem Structure for Efficient Clause Learning (AS, PB, HAK), pp. 242–256.