6.7k citations
- Princeton UniversityUS205 papers
- Fermi National Accelerator LaboratoryUS199 papers
- Northwestern UniversityUS199 papers
- University of RochesterUS196 papers
- University of California, RiversideUS194 papers
- Imperial College LondonGB193 papers
- RWTH Aachen UniversityDE193 papers
- University at Buffalo, State University of New YorkUS193 papers
- Rice UniversityUS192 papers
- University of KansasUS192 papers
- Florida State UniversityUS191 papers
- Northeastern UniversityUS191 papers
Showing 2012 · cs.AIShow all
2 papers · 2 filters
cs.AI2012★ 30 cited
A constraint satisfaction approach to the robust spanning tree problem with interval data
Ionut Aron, Pascal Van Hentenryck
Robust optimization is one of the fundamental approaches to deal with uncertainty in combinatorial optimization. This paper considers the robust spanning tree problem with interval…
cs.AI2012★ 13 cited
Gibbs Sampling in Open-Universe Stochastic Languages
Nimar S. Arora, Rodrigo de Salvo Braz, Erik B. Sudderth +1
Languages for open-universe probabilistic models (OUPMs) can represent situations with an unknown number of objects and iden- tity uncertainty. While such cases arise in a wide ran…