conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

1
6
27
149
97
'05
'10
'15
'20
'25

Papers

Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding IJCAI 2019
Solving the Satisfiability Problem of Modal Logic S5 Guided by Graph Coloring IJCAI 2019
Resolution and Domination: An Improved Exact MaxSAT Algorithm IJCAI 2019
Path Planning with CPD Heuristics IJCAI 2019
Direction-Optimizing Breadth-First Search with External Memory Storage IJCAI 2019
Branch-and-Cut-and-Price for Multi-Agent Pathfinding IJCAI 2019
Earliest-Completion Scheduling of Contract Algorithms with End Guarantees IJCAI 2019
Sharpness of the Satisfiability Threshold for Non-Uniform Random k-SAT IJCAI 2019
Clause Learning and New Bounds for Graph Coloring IJCAI 2019
Optimally Efficient Bidirectional Search IJCAI 2019
A Survey on Hierarchical Planning – One Abstract Idea, Many Concrete Realizations IJCAI 2019
Matching with Constraints IJCAI 2019
Multi-Agent Path Finding on Ozobots IJCAI 2019
Constraint-based Learning of Phonological Processes IJCNLP 2019
Near Optimal Frequent Directions for Sketching Dense and Sparse Matrices JMLR 2019
Learnability of Solutions to Conjunctive Queries JMLR 2019
Decomposed Local Models for Coordinate Structure Parsing NAACL 2019
Eiffel: Efficient and Flexible Software Packet Scheduling NSDI 2019
Direct Universal Access: Making Data Center Resources Available to FPGA NSDI 2019
Hyperscan: A Fast Multi-pattern Regex Matcher for Modern CPUs NSDI 2019
A Polynomial-time Solution for Robust Registration with Extreme Outlier Rates RSS 2019
Adaptive Hashing for Model Counting UAI 2019
Finding Minimal d-separators in Linear Time and Applications UAI 2019
Exact Sampling of Directed Acyclic Graphs from Modular Distributions UAI 2019
Computing Higher Order Derivatives of Matrix and Tensor Expressions NIPS 2018