A two phase exact algorithm for MAX SAT and weighted MAX SAT problems * Brian BorchersJr Judith Furmanl

Source URL: infohost.nmt.edu

Properties of IsaCoSy’s Constraint Generation Algorithm Moa Johansson, Lucas Dixon, Alan Bundy February 16, 2010 Abstract This report states and sketches the proofs for some important properties of

Source URL: dream.inf.ed.ac.uk

• Constraint programming
• Theoretical computer science
• Constraint
• Mathematical optimization
• Exact cover
• Logic programming
• Software engineering
• Cognitive science
• Constraint logic programming
• First class constraint

Exact and Efficient Generation of Geometric Random Variates and Random Graphs Karl Bringmann1 and Tobias Friedrich2 1 Max-Planck-Institut f¨

Source URL: people.mpi-inf.mpg.de

• Mathematics
• Computational complexity theory
• Graph theory
• Analysis of algorithms
• NP-complete problems
• Probabilistic complexity theory
• Combinatorics
• Randomized algorithm
• Rejection sampling
• NP
• Independent set
• Poisson distribution

Introduction to the Social Web Content Search, Recommendation, and Exploration Sihem Amer-Yahia CNRS/LIG Nov 18th, 2015

Source URL: exmo.inria.fr

• Algorithm
• Mathematical logic
• Theoretical computer science
• Recommender system
• Exact algorithm
• Mathematics
• Applied mathematics
• Science

CS264: Beyond Worst-Case Analysis Lecture #8: Exact Recovery in Stable Cut Instances∗ Tim Roughgarden† October 15,

Source URL: theory.stanford.edu

• Combinatorial optimization
• Linear programming relaxation
• Maximum flow problem
• Maximum cut
• Linear programming
• Cut
• Candidate solution
• Randomized algorithm
• Max-flow min-cut theorem
• Randomized rounding

Change Of Order For Bivariate Triangular Sets ´ Eric Schost Cyril Pascal

Source URL: www.csd.uwo.ca

• Polynomials
• Lemmas
• Generating function
• NC
• Elliptic curve
• Closed and exact differential forms
• Euclidean algorithm
• Permutation polynomial
• Transcendental number

Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces Jens J¨ agersk¨ upper? FB Informatik, LS 2, Univ. Dortmund, 44221 Dortmund, Germany

Source URL: ls2-www.cs.uni-dortmund.de

• Lemmas
• Differential forms
• Differential geometry
• Analysis of algorithms
• Asymptotic analysis
• Big O notation
• Closed and exact differential forms
• Differential geometry of surfaces
• Expected value

Disambiguating Road Names in Text Route Descriptions using Exact-All-Hop Shortest Path Algorithm Xiao Zhang⋆ △ and Baojun Qiu⋆⋄ and Prasenjit Mitra⋆† and Sen Xu‡ and Alexander Klippel‡ and Alan M. MacEach

Source URL: cognitivegiscience.psu.edu

• Network theory
• Routing algorithms
• Edsger W. Dijkstra
• Graph connectivity
• NP-complete problems
• Shortest path problem
• Distance
• Path
• Longest path problem
• K shortest path routing
• FloydWarshall algorithm

Speeding Up Many-Objective Optimization by Monte Carlo Approximations Karl Bringmanna , Tobias Friedrichb,∗, Christian Igelc , Thomas Voßd a Max-Planck-Institut f¨

Source URL: people.mpi-inf.mpg.de

• Mathematical optimization
• Operations research
• Computational complexity theory
• Evolution
• Multi-objective optimization
• CMA-ES
• Approximation algorithm
• Exact algorithm
• Multiple-criteria decision analysis
• Algorithm
• Evolutionary algorithm
• Pareto efficiency

Exact-Present Solution with Consistent-Future Approximation: A Gridless Algorithm to Solve Stochastic Dynamic Models Wouter J. Den Haan, Michal L. Kobielarz and Pontus Rendahl∗ January 19, 2016

Source URL: www.wouterdenhaan.com