Under-Approximation Refinement for Classical Planning Manuel Heusner and Martin Wehrle and Florian Pommerening and Malte Helmert University of Basel, Switzerland {manuel.heusner,martin.wehrle,florian.pommerening,malte.he

Source URL: ai.cs.unibas.ch

• Planning
• Heuristic function
• Automated planning and scheduling
• Mind
• Science
• Neuropsychology
• Algorithm
• Mathematical logic
• Theoretical computer science

What is the nearest neighbor in high dimensional spaces? Alexander Hinneburgy Charu C. Aggarwalz y Institute of Computer Science, University of Halle

Source URL: fusion.cs.uni-magdeburg.de

• Artificial intelligence
• Machine learning
• Numerical analysis
• Approximation algorithms
• Data mining
• Nearest neighbor search
• K-nearest neighbor algorithm
• R-tree
• IDistance
• Information science
• Search algorithms
• Mathematics

Potential and Challenges of Two-VariablePer-Inequality Sub-Polyhedral Compilation Ramakrishna Upadrasta Albert Cohen INRIA and LRI, Paris-Sud 11 University

Source URL: perso.ens-lyon.fr

• Operations research
• Computational complexity theory
• Convex optimization
• Linear programming
• Polyhedron
• Mathematical optimization
• Approximation algorithm
• Simplex algorithm
• Algorithm
• Theoretical computer science
• Applied mathematics
• Mathematics

Fast Additive Constant Approximation Algorithms for The Safe Deposit Boxes Problem with Two and Three Currencies Boaz Ben-Moshe1 1 Yefim Dinitz2

Source URL: cccg.ca

• Ordinal numbers
• Logic
• Ordinal arithmetic
• Set theory
• Curry–Howard correspondence
• Mathematical logic
• Proof theory
• Mathematics

CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗†

Source URL: 2011.cccg.ca

• Mathematics
• Dominating set
• Unit disk graph
• Independent set
• APX
• Approximation algorithm
• Vertex cover
• Planar separator theorem
• Theoretical computer science
• Graph theory
• NP-complete problems

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Maximal Covering by Two Isothetic Unit Squares Priya Ranjan Sinha Mahapatra ∗

Source URL: cccg.ca

• Proof theory
• Diophantine approximation
• Dynamic programming
• Earley parser
• Euclidean algorithm
• Mathematics
• Mathematical analysis
• Mathematical logic

On Ensemble Techniques for AIXI Approximation Joel Veness1 , Peter Sunehag2 , and Marcus Hutter2 1 University of Alberta

Source URL: jveness.info

Solving online feasibility problem in constant amortized time per update Lilian Buzer∗† global shape of the pixels by minimizing an approximation error. But, using digital primitives we can build an exact approximati

Source URL: www.cccg.ca

• Applied mathematics
• Convex optimization
• Linear programming
• Constraint
• Candidate solution
• Algorithm
• Linear programming relaxation
• LP-type problem
• Mathematical optimization
• Operations research
• Mathematics

grothendieck.24-jan-11.dvi

Source URL: www.math.tamu.edu

• Mathematical analysis
• Nuclear space
• Hilbert space
• Compact operator
• Vector space
• Banach space
• Von Neumann algebra
• Approximation property
• Lp space
• Algebra
• Operator theory
• Mathematics

Top-k Aggregation Using Intersections of Ranked Inputs Ravi Kumar Kunal Punera Torsten Suel

Source URL: www.wsdm2009.org

• Operations research
• Mathematical optimization
• Search algorithms
• Theoretical computer science
• Convex optimization
• Algorithm
• Nearest neighbor search
• Linear programming
• Approximation algorithm
• Mathematics
• Information science
• Applied mathematics