#### Filter Results:

- Full text PDF available (158)

#### Publication Year

1953

2017

- This year (13)
- Last 5 years (53)
- Last 10 years (102)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Organism

Learn More

- Carla P. Gomes, Bart Selman, Henry A. Kautz
- AAAI/IAAI
- 1998

Unpredictability in the running time of complete search procedures can often be explained by the phenomenon of “heavy-tailed cost distributions”, meaning that at any time during the experiment there… (More)

- Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. Kautz
- Journal of Automated Reasoning
- 2000

We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in performance. Our study… (More)

- Ryan Williams, Carla P. Gomes, Bart Selman
- IJCAI
- 2003

There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can handle combinatorial… (More)

- Carla P. Gomes, Jörg Hoffmann, Ashish Sabharwal, Bart Selman
- IJCAI
- 2007

We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previous approaches, our… (More)

- Dimitris Achlioptas, Carla P. Gomes, Henry A. Kautz, Bart Selman
- AAAI/IAAI
- 2000

A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guaranteed to be… (More)

- Carla P. Gomes, Bart Selman
- Artif. Intell.
- 2001

- Carla P. Gomes, Ashish Sabharwal, Bart Selman
- AAAI
- 2006

Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satisfiability, and hence… (More)

- Carla P. Gomes, Ashish Sabharwal, Bart Selman
- NIPS
- 2006

We propose a new technique for sampling the solutions of combinatorial problems in a near-uniform manner. We focus on problems specified as a Boolean formula, i.e., on SAT instances. Sampling for SAT… (More)

- Carla P. Gomes, Bart Selman
- AAAI/IAAI
- 1997

Recent progress on search and reasoning procedures has been driven by experimentation on computation-ally hard problem instances. Hard random problem distributions are an important source of such… (More)

We introduce a graph coloring challenge benchmark based on the problem of completing Latin squares. We show how the hardness of the instances can be finely controlled by varying the fraction of… (More)