conftrace_
← Foundations
Computer Science › Foundations ›

Algorithms

1,298 papers

Papers per year

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

Papers

Practical Frank–Wolfe Method with Decision Diagrams for Computing Wardrop Equilibrium of Combinatorial Congestion Games AAAI 2020
A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search AAAI 2020
Envelope-Based Approaches to Real-Time Heuristic Search AAAI 2020
A Learning Based Branch and Bound for Maximum Common Subgraph Related Problems AAAI 2020
Deciding Acceptance in Incomplete Argumentation Frameworks AAAI 2020
Learning Optimal Decision Trees Using Caching Branch-and-Bound Search AAAI 2020
TellTail: Fast Scoring and Detection of Dense Subgraphs AAAI 2020
A Simple and Efficient Tensor Calculus AAAI 2020
Stochastically Robust Personalized Ranking for LSH Recommendation Retrieval AAAI 2020
Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String AAAI 2020
Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation AAAI 2020
Robust Tensor Decomposition via Orientation Invariant Tubal Nuclear Norms AAAI 2020
Global Greedy Dependency Parsing AAAI 2020
Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming AAAI 2020
A MaxSAT-Based Framework for Group Testing AAAI 2020
On the Problem of Covering a 3-D Terrain AAAI 2020
Task and Motion Planning Is PSPACE-Complete AAAI 2020
Action Graphs for Goal Recognition Problems with Inaccurate Initial States (Student Abstract) AAAI 2020
Opening the Black Box: Automatically Characterizing Software for Algorithm Selection (Student Abstract) AAAI 2020
Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020
Dscorer: A Fast Evaluation Metric for Discourse Representation Structure Parsing ACL 2020
Do Transformers Need Deep Long-Range Memory? ACL 2020
Multi-Tiered Strictly Local Functions ACL 2020
Measuring Mutual Information Between All Pairs of Variables in Subquadratic Complexity AISTATS 2020
Bounds in query learning COLT 2020