Discrete Optimization

Testing Determinantal Point Processes NeurIPS 2020 Threshold Treewidth and Hypertree Width IJCAI 2020 Using Approximation within Constraint Programming to Solve the Parallel Machine Scheduling Problem with Additional Unit Resources AAAI 2020 Adaptive Hashing for Model Counting UAI 2019 Approximation Algorithms for Stochastic Clustering JMLR 2019 A Refined Understanding of Cost-optimal Planning with Polytree Causal Graphs IJCAI 2019 A Tree-Based Method for Fast Repeated Sampling of Determinantal Point Processes ICML 2019 Borda Count in Collective Decision Making: A Summary of Recent Results AAAI 2019 Bottleneck Potentials in Markov Random Fields ICCV 2019 Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019 Clause Learning and New Bounds for Graph Coloring IJCAI 2019 Computational Intractability and Solvability for the Birds of a Feather Game AAAI 2019 Computer Generation of Birds of a Feather Puzzles AAAI 2019 Counting the Optimal Solutions in Graphical Models NeurIPS 2019 Coverage Centrality Maximization in Undirected Networks AAAI 2019 DepDist: Surface realization via regex and learned dependency-distance tolerance EMNLP 2019 Discrete Laplace Operator Estimation for Dynamic 3D Reconstruction ICCV 2019 Efficiently Learning Fourier Sparse Set Functions NeurIPS 2019 Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines AAAI 2019 Efficient Search-Based Weighted Model Integration UAI 2019 Efficient Solving of Birds of a Feather Puzzles AAAI 2019 Equitable Stable Matchings in Quadratic Time NeurIPS 2019 Evolving Solutions to Community-Structured Satisfiability Formulas AAAI 2019 Fast Decomposable Submodular Function Minimization using Constrained Total Variation NeurIPS 2019 Fast Parallel Algorithms for Statistical Subset Selection Problems NeurIPS 2019