Algorithms

BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting AAAI 2019 Branch-and-Cut-and-Price for Multi-Agent Pathfinding IJCAI 2019 Bringing Order to Chaos – A Compact Representation of Partial Order in SAT-Based HTN Planning AAAI 2019 Canonical Soft Time Warping ACML 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 Combinatorial Algorithms for Optimal Design COLT 2019 Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs AAAI 2019 Computational Intractability and Solvability for the Birds of a Feather Game AAAI 2019 Constraint-based Learning of Phonological Processes EMNLP 2019 Convolutional Approximations to the General Non-Line-of-Sight Imaging Operator ICCV 2019 Coresets for Ordered Weighted Clustering ICML 2019 Correlation clustering with local objectives NeurIPS 2019 Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithms NeurIPS 2019 Decomposed Local Models for Coordinate Structure Parsing NAACL 2019 DepDist: Surface realization via regex and learned dependency-distance tolerance EMNLP 2019 Detection of Planted Solutions for Flat Satisfiability Problems AISTATS 2019 Direction-Optimizing Breadth-First Search with External Memory Storage IJCAI 2019 Direct Universal Access: Making Data Center Resources Available to FPGA NSDI 2019 DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node NeurIPS 2019 Distributed PageRank Computation: An Improved Theoretical Study AAAI 2019 Don't take it lightly: Phasing optical random projections with unknown operators NeurIPS 2019 Earliest-Completion Scheduling of Contract Algorithms with End Guarantees IJCAI 2019 Efficiently Learning Fourier Sparse Set Functions NeurIPS 2019 Efficient Solving of Birds of a Feather Puzzles AAAI 2019