116 citations · 238 across the 4 of their papers we have counts for
4 papers
Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization
Stefano Ermon, Carla P. Gomes, Ashish Sabharwal +1
Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high…
Algorithm Portfolio Design: Theory vs. Practice
Carla P. Gomes, Bart Selman
Stochastic algorithms are among the best for solving computationally hard search and reasoning problems. The runtime of such procedures is characterized by a random variable. Diffe…
A Bayesian Approach to Tackling Hard Computational Problems
Eric J. Horvitz, Yongshao Ruan, Carla P. Gomes +3
We are developing a general framework for using learned Bayesian models for decision-theoretic control of search and reasoningalgorithms. We illustrate the approach on the specific…
Uniform Solution Sampling Using a Constraint Solver As an Oracle
Stefano Ermon, Carla P. Gomes, Bart Selman
We consider the problem of sampling from solutions defined by a set of hard constraints on a combinatorial space. We propose a new sampling technique that, while enforcing a unifor…