Publications

12 results for Bart Selman

Designing fast absorbing Markov chains
- - Stefano Ermon
  - Carla P. Gomes
  - et al.
- 2014
- AAAI 2014
Low-density parity constraints for hashing-based discrete integration
- - Stefano Ermon
  - Carla P. Gomes
  - et al.
- 2014
- ICML 2014
Embed and project: Discrete sampling with universal hashing
- - Stefano Ermon
  - Carla P. Gomes
  - et al.
- 2013
- NeurIPS 2013
Optimization with parity constraints: From binary codes to discrete integration
- - Stefano Ermon
  - Carla P. Gomes
  - et al.
- 2013
- UAI 2013
Taming the curse of dimensionality: Discrete integration by hashing and optimization
- - Stefano Ermon
  - Carla P. Gomes
  - et al.
- 2013
- ICML 2013
Density Propagation and improved bounds on the partition function
- - Stefano Ermon
  - Carla P. Gomes
  - et al.
- 2012
- NeurIPS 2012
Accelerated Adaptive Markov Chain for partition function computation
- - Stefano Ermon
  - Carla P. Gomes
  - et al.
- 2011
- NeurIPS 2011
AIPS-98 planning competition
- - Derek Long
  - Henry Kautz
  - et al.
- 2000
- AI Magazine
Determining computational complexity from characteristic 'phase transitions'
- - Rémi Monasson
  - Riccardo Zecchina
  - et al.
- 1999
- Nature
2 + p-SAT: Relation of typical-case complexity to the nature of the phase transition
- - Rémi Monasson
  - Riccardo Zecchina
  - et al.
- 1999
- Random Structures and Algorithms