Foundations

Extended Increasing Cost Tree Search for Non-Unit Cost Domains IJCAI 2018 Fact-Alternating Mutex Groups for Classical Planning (Extended Abstract) IJCAI 2018 Finding Frequent Entities in Continuous Data IJCAI 2018 Finding Minimal Separators in LWF Chain Graphs PGM 2018 Five-Point Fundamental Matrix Estimation for Uncalibrated Cameras CVPR 2018 Found Graph Data and Planted Vertex Covers NeurIPS 2018 Functional Partitioning of Ontologies for Natural Language Query Completion in Question Answering Systems IJCAI 2018 Generalized Binary Search For Split-Neighborly Problems AISTATS 2018 Generalizing Graph Matching beyond Quadratic Assignment Model NeurIPS 2018 Generating Plans for Cooperative Connected UAVs IJCAI 2018 Handling implicit and explicit constraints in manipulation planning RSS 2018 Improving Information Centrality of a Node in Complex Networks by Adding Edges IJCAI 2018 Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies IJCAI 2018 Information-theoretic Limits for Community Detection in Network Models NeurIPS 2018 Interactive Robot Transition Repair With SMT IJCAI 2018 Large Vocabulary Concatenative Resynthesis Interspeech 2018 Latent RANSAC CVPR 2018 Learning Optimal Decision Trees with SAT IJCAI 2018 Learning SMT(LRA) Constraints using SMT Solvers IJCAI 2018 Learning to Branch ICML 2018 Learning to Solve SMT Formulas NeurIPS 2018 Linear Satisfiability Preserving Assignments (Extended Abstract) IJCAI 2018 Local Density Estimation in High Dimensions ICML 2018 Maintenance of Case Bases: Current Algorithms after Fifty Years IJCAI 2018 Maximin Share Allocations on Cycles IJCAI 2018