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

COVER LETTERS 101 [Include the personalized letterhead you created for your resume with the exact same formatting] Date Contact First & Last Name Company Name Company Address

Source URL: www.bcitsa.ca

• Writing
• Rsum
• Paragraph

JMLR: Workshop and Conference Proceedings vol–21 Randomized partition trees for exact nearest neighbor search Sanjoy Dasgupta

Source URL: jmlr.org

• Search algorithms
• Nearest neighbor search
• K-d tree
• K-nearest neighbors algorithm
• Locality-sensitive hashing
• R-tree
• Cover tree
• Expected value

Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm? Francisco Claude1 , Reza Dorrigiv1 , Stephane Durocher2 , Robert Fraser1 , Alejandro L´ opez-Ortiz1 ?? , and Alejandro Salinger1 1

Source URL: www.cs.umanitoba.ca

Data Reduction, Exact, and Heuristic Algorithms for Clique Cover Jens Gramm Jiong Guo

Source URL: www.user.tu-berlin.de

Sage Reference Manual: Games Release 6.7 The Sage Development Team June 24, 2015

Source URL: doc.sagemath.org

• Search algorithms
• Applied mathematics
• Recreational mathematics
• Puzzle video games
• Dancing Links
• Backtracking
• Exact cover
• Puzzle
• Sudoku algorithms
• Mathematics
• Sudoku
• NP-complete problems

CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract

Source URL: 2011.cccg.ca

• Approximation algorithms
• Functions and mappings
• Computational complexity theory
• APX
• Logarithm
• Integral
• Function
• L-reduction
• Metric
• Mathematics
• Theoretical computer science
• Mathematical analysis

Open Problems in Parameterized and Exact Computation — IWPEC 2008 Hans L. Bodlaender Erik D. Demaine Michael R. Fellows Jiong Guo

Source URL: www.mrfellows.net

• NP-complete problems
• Parameterized complexity
• Kernelization
• Path decomposition
• Clique
• Tree decomposition
• Vertex cover
• Dominating set
• Edge coloring
• Graph theory
• Theoretical computer science
• Mathematics

Optimising Quantified Expressions in Constraint Models Ian Gent, Ian Miguel, and Andrea Rendl University of St Andrews School of Computer Science, North Haugh, St Andrews, Scotland, UK ipg,ianm,

Source URL: andrearendl.com

• Sudoku algorithms
• Constraint programming
• Declarative programming
• Exact cover

CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract

Source URL: www.cccg.ca

• Approximation algorithms
• Functions and mappings
• Computational complexity theory
• APX
• Logarithm
• Integral
• Function
• L-reduction
• Metric
• Mathematics
• Theoretical computer science
• Mathematical analysis