← Foundations
Computer Science › Foundations ›

Algorithms

1295 directly classified papers

Papers per year

Papers

Earliest-Completion Scheduling of Contract Algorithms with End Guarantees IJCAI 2019
A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem AAAI 2019
Optimal Analysis of Subset-Selection Based L_p Low-Rank Approximation NIPS 2019
Faster width-dependent algorithm for mixed packing and covering LPs NIPS 2019
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration NIPS 2019
A PSPACE Subclass of Dependency Quantified Boolean Formulas and Its Effective Solving AAAI 2019
A Genetic Algorithm for Finding a Small and Diverse Set of Recent News Stories on a Given Subject: How We Generate AAAI’s AI-Alert AAAI 2019
Machine Learning Based Heuristic Search Algorithms to Solve Birds of a Feather Card Game AAAI 2019
Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms NIPS 2019
Teaching Multiple Concepts to a Forgetful Learner NIPS 2019
Constraint-based Learning of Phonological Processes IJCNLP 2019
Enriching Non-Parametric Bidirectional Search Algorithms AAAI 2019
Matching with Constraints IJCAI 2019
Hyperscan: A Fast Multi-pattern Regex Matcher for Modern CPUs NSDI 2019
Complexity of Inconsistency-Tolerant Query Answering in Datalog+/– under Cardinality-Based Repairs AAAI 2019
Path Planning with CPD Heuristics IJCAI 2019
Eiffel: Efficient and Flexible Software Packet Scheduling NSDI 2019
On Succinct Encodings for the Tournament Fixing Problem IJCAI 2019
Distributed PageRank Computation: An Improved Theoretical Study AAAI 2019
Sublinear Time Nearest Neighbor Search over Generalized Weighted Space ICML 2019
On the Optimal Efficiency of Cost-Algebraic A* AAAI 2019
On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games AAAI 2019
Approximation and Hardness of Shift-Bribery AAAI 2019
Random Walk Decay Centrality AAAI 2019
Modular Materialisation of Datalog Programs AAAI 2019