Travelled to:1 × China
1 × Finland
1 × Italy
1 × Portugal
1 × Sweden
1 × United Kingdom
3 × USA
Collaborated with:B.Selman A.Sabharwal S.Ermon R.LeBras B.N.Dilkina Y.Ruan H.A.Kautz D.R.Smith S.J.Westfold M.Finger J.Hoffmann T.Damoulas J.He R.Bernstein A.Arora R.B.v.Dover C.Ansótegui J.W.Hart R.Béjar A.Cabiscol C.Fernández F.Manyà E.Horvitz D.M.Chickering D.Achlioptas M.E.Stickel
Talks about:constraint (2) satisfi (2) problem (2) discret (2) integr (2) optim (2) model (2) count (2) hash (2) hard (2)
Person: Carla P. Gomes
DBLP: Gomes:Carla_P=
Facilitated 1 volumes:
EdContributed to:
2014
20142013201320122009200720062001
1996Wrote 12 papers:
- ICML-c1-2014-ErmonGSS #constraints #integration
- Low-density Parity Constraints for Hashing-Based Discrete Integration (SE, CPG, AS, BS), pp. 271–279.
- ICPR-2014-DamoulasHBGA #kernel #string
- String Kernels for Complex Time-Series: Counting Targets from Sensed Movement (TD, JH, RB, CPG, AA), pp. 4429–4434.
- 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-FingerLGS #constraints #probability #satisfiability #using
- Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (MF, RL, CPG, BS), pp. 233–249.
- SAT-2012-ErmonLGSD #combinator
- SMT-Aided Combinatorial Materials Discovery (SE, RL, CPG, BS, RBvD), pp. 172–185.
- SAT-2009-DilkinaGS #learning
- Backdoors in the Context of Learning (BND, CPG, AS), pp. 73–79.
- 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.
- SAT-2001-BejarCFMG #logic #satisfiability
- Extending the Reach of SAT with Many-Valued Logics (RB, AC, CF, FM, CPG), pp. 392–407.
- SAT-2001-HorvitzRGKSC #approach #problem
- A Bayesian Approach to Tackling Hard Computational Problems (EH, YR, CPG, HAK, BS, DMC), pp. 376–391.
- SAT-2001-KautzRAGSS #problem #satisfiability
- Balance and Filtering in Structured Satisfiable Problems (HAK, YR, DA, CPG, BS, MES), pp. 2–18.
- KBSE-1996-GomesSW #synthesis
- Synthesis of Schedulers for Planned Shutdowns of Power Plants (CPG, DRS, SJW), p. 6.