On First-Order Meta-Learning Algorithms arXiv:1803.02999v3 [cs.LG] 22 Oct 2018 Alex Nichol and Joshua Achiam and John Schulman OpenAI

Source URL: arxiv.org

• Numerical analysis
• Mathematical analysis
• Mathematical optimization
• Generalized functions
• Distribution
• Functional analysis
• Stochastic gradient descent
• Gradient descent

Mike Izbicki About Me My research makes machine learning algorithms faster. I’ve developed improved data structures for nearest neighbor queries and faster distributed learning procedures. I use techniques from high di

Source URL: izbicki.me

• Cybernetics
• Computing
• Technology
• Software engineering
• Computational neuroscience
• International Conference on Machine Learning
• Outline of machine learning
• Machine learning
• Haskell
• University of California
• Riverside
• Artificial intelligence

Coping with Inconsistent Databases Semantics, Algorithms, and Complexity Phokion G. Kolaitis University of California Santa Cruz and

Source URL: sat2016.labri.fr

• Database theory
• Computing
• Data management
• Information science
• Conjunctive query
• Relational model
• Boolean conjunctive query
• Relational database
• FO
• Functional dependency
• Query language

Time-memory Trade-offs for Near-collisions Ga¨etan Leurent UCL Crypto Group Abstract. In this work we consider generic algorithms to find nearcollisions for a hash function. If we consider o

Source URL: who.rocq.inria.fr

• Search algorithms
• Information retrieval
• Information science
• Cryptography
• Hashing
• Cryptographic hash functions
• Error detection and correction
• Hash function
• Hash table
• Hopf decomposition
• Compound of twelve pentagonal antiprisms with rotational freedom

OpenRec: A Modular Framework for Extensible and Adaptable Recommendation Algorithms

Source URL: www.cs.cornell.edu

Playing with AVATAR Giles Reger, Martin Suda and Andrei Voronkov ? University of Manchester, Manchester, UK Abstract. Modern first-order resolution and superposition theorem provers use saturation algorithms to search fo

Source URL: www.cs.man.ac.uk

• Theoretical computer science
• Automated theorem proving
• Mathematics
• Mathematical logic
• Formal methods
• Logic in computer science
• Resolution
• Logic programming
• Clause
• Vampire
• Boolean satisfiability problem
• CARINE

Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling Ioannis Caragiannis1 , Vasilis Gkatzelis2 , and Cosimo Vinci3 1 University of Patras, Rion-Patras, Greece

Source URL: www.cs.drexel.edu

• Game theory
• Permutation
• Price of anarchy
• Shapley value
• Approximation algorithm
• Mathematics
• Microeconomics
• Mathematical economics

Introduction Applications SMT Solver Use Algorithms Conclusion

Source URL: user.it.uu.se

• Theoretical computer science
• Logic in computer science
• Formal methods
• Mathematics
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Formal verification
• Model checking
• SMT

SPECIFICATION AND DEVELOPMENT OF PARALLEL ALGORITHMS WITH THE PROTEUS SYSTEM ALLEN GOLDBERG, PETER MILLS, LARS NYLAND, JAN PRINS, JOHN REIF, AND JAMES RIELY Abstract. The Proteus language is a wide-spectrum parallel prog

Source URL: www.kestrel.edu

• Computing
• Parallel computing
• Computer programming
• Software engineering
• Data parallelism
• Proteus
• Implicit parallelism
• Concurrent computing
• Parallelism
• Scala

Automatic Discovery of Mutual Exclusion Algorithms∗ (Preliminary Version) Yoah Bar-David Gadi Taubenfeld

Source URL: www.faculty.idc.ac.il