← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT IJCAI 2019
Clause Learning and New Bounds for Graph Coloring IJCAI 2019
Convolutional Approximations to the General Non-Line-of-Sight Imaging Operator ICCV 2019
Progressive-X: Efficient, Anytime, Multi-Model Fitting Algorithm ICCV 2019
New Convex Relaxations for MRF Inference With Unknown Graphs ICCV 2019
The Parameterized Complexity of Cascading Portfolio Scheduling NIPS 2019
Smoothing Structured Decomposable Circuits NIPS 2019
Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding IJCAI 2019
Enhancing Lazy Grounding with Lazy Normalization in Answer-Set Programming AAAI 2019
Optimally Efficient Bidirectional Search IJCAI 2019
A Survey on Hierarchical Planning – One Abstract Idea, Many Concrete Realizations IJCAI 2019
On Communication Complexity of Classification Problems COLT 2019
Analysis of Feature Visibility in Non-Line-Of-Sight Measurements CVPR 2019
Multi-Agent Path Finding on Ozobots IJCAI 2019
Clairvoyant Restarts in Branch-and-Bound Search Using Online Tree-Size Estimation AAAI 2019
A SAT+CAS Approach to Finding Good Matrices: New Examples and Counterexamples AAAI 2019
Solving Integer Quadratic Programming via Explicit and Structural Restrictions AAAI 2019
Automatic Construction of Parallel Portfolios via Explicit Instance Grouping AAAI 2019
Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking AAAI 2019
Evolving Solutions to Community-Structured Satisfiability Formulas AAAI 2019
SAT-Based Explicit LTLf Satisfiability Checking AAAI 2019
Learning How to Ground a Plan – Partial Grounding in Classical Planning AAAI 2019
Multi-Agent Path Finding for Large Agents AAAI 2019
Online Multi-Agent Pathfinding AAAI 2019
Computational Intractability and Solvability for the Birds of a Feather Game AAAI 2019