REPETITA: Repeatable Experiments for Performance Evaluation of Traffic-Engineering Algorithms Steven Gay ∗, Pierre Schaus ∗, Stefano Vissicchio † ∗ Universite catholique de Louvain, † University College London

Source URL: arxiv.org

• Computing
• Mathematics
• Mathematical software
• Routing
• Internet architecture
• Emerging technologies
• Network architecture
• Load balancing
• Open Shortest Path First
• Computer network
• Solver
• Network topology

Exploiting Search Space Structure in Classical Planning: Analyses and Algorithms (Dissertation Abstract) Masataro Asai Graduate School of Arts and Sciences University of Tokyo

Source URL: icaps16.icaps-conference.org

• Game artificial intelligence
• Routing algorithms
• Computer programming
• Computing
• Mathematics
• Automated planning and scheduling
• Theoretical computer science
• Macro
• Satisficing
• A* search algorithm
• Planning Domain Definition Language
• Heuristic

Asymptotically faster quantum algorithms to solve multivariate quadratic equations Daniel J. Bernstein1 and Bo-Yin Yang2 1 Department of Computer Science

Source URL: precision.moscito.org

• Mathematics
• Algebra
• Equations
• Linear algebra
• Monomial
• Ordinary differential equations
• Recurrence relation
• Equation solving
• Elementary algebra
• Equation
• System of linear equations
• Algebraic curve

Practical Algorithms for Incremental Software Development Environments Tim A. Wagner March 10, 1998 Preface

Source URL: www2.eecs.berkeley.edu

• Programming language implementation
• Compiler construction
• Computing
• Software engineering
• Parsing
• Parsing algorithms
• SYNTAX
• LR parser
• Deterministic parsing
• Identifier

Verification of Markov Decision Processes using Learning Algorithms? Tom´asˇ Br´azdil1 , Krishnendu Chatterjee2 , Martin Chmel´ık2 , Vojtˇech Forejt3 , Jan Kˇret´ınsk´y2 , Marta Kwiatkowska3 , David Parker4 , a

Source URL: qav.comlab.ox.ac.uk

• Computational complexity theory
• Dynamic programming
• Markov processes
• Stochastic control
• Analysis of algorithms
• Markov decision process
• Reinforcement learning
• Time complexity
• PP
• Reachability

Axiomatic Foundations and Algorithms for Deciding Semantic Equivalences of SQL Queries Shumo Chu, Brendan Murphy, Jared Roesch, Alvin Cheung, Dan Suciu Paul G. Allen School of Computer Science and Engineering University

Source URL: www.vldb.org

Star-Cap: Cluster Power Management Using Software-Only Models John D. Davis Suzanne Rivoire () Moisés Goldszmidt (Microsoft Research) ICPP Workshop on Power-aware Algorithms,

Source URL: rivoire.cs.sonoma.edu

Splitting on Demand in SAT Modulo Theories Clark Barrett? , Robert Nieuwenhuis?? , Albert Oliveras??, and Cesare Tinelli? ? ? Abstract. Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-base

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Constraint programming
• Automated theorem proving
• Logic in computer science
• Formal methods
• Propositional calculus
• Satisfiability modulo theories
• DPLL algorithm
• Unit propagation
• Solver

Lecture 18, Tues March 28: Bernstein-Vazirani, Simon We ended last time with the Deutsch-Jozsa problem. Today we’ll start with another black-box problem for which quantum algorithms provide an advantage: The Bernstein-

Source URL: www.scottaaronson.com

• Theoretical computer science
• Quantum computing
• Quantum mechanics
• Quantum information science
• Emerging technologies
• Quantum algorithms
• Randomized algorithm
• Qubit
• Shor's algorithm
• DeutschJozsa algorithm

Canonical Forms for Isomorphic and Equivalent RDF Graphs: Algorithms for Leaning and Labelling Blank Nodes AIDAN HOGAN, Center for Semantic Web Research, DCC, University of Chile, Chile Existential blank nodes greatly co

Source URL: aidanhogan.com

• Graph theory
• Mathematics
• Semantic Web
• Discrete mathematics
• Morphisms
• Resource Description Framework
• Graph operations
• Blank node
• Graph isomorphism
• Graph homomorphism
• Cograph
• RDF Schema