Journal of Biotechnology–23 Theoretical analysis of dynamic force spectroscopy experiments on ligand–receptor complexes M. Raible a , M. Evstigneev a , P. Reimann a,∗ , F.W. Bartels b , R. Ros b a

Source URL: roslab.physics.asu.edu

• Computational chemistry
• Classical mechanics
• Spectroscopy
• Force spectroscopy
• Molecular dynamics
• Fictitious force
• Force
• Constraint algorithm
• Physics
• Chemistry
• Science

Submission to the Commission on the Limits of the Continental Shelf pursuant to Article 76, paragraph 8 of the United Nations Convention on the Law of the Sea 1982

Source URL: www.unclosuk.org

INFORMS INFORMS JOURNAL ON COMPUTING Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn | eissn | 00 | 0000 | 0001

Source URL: homepages.laas.fr

• Business
• Constraint optimization
• Mathematical optimization
• Artificial intelligence
• Search algorithm
• Scheduling
• Constraint satisfaction
• Constraint programming
• Computing
• Local consistency

Quering Incomplete Information in Semistructured Data Yaron Kanza Werner Nutty

Source URL: www.cs.technion.ac.il

• Theoretical computer science
• Data management
• Conjunctive query
• Database theory
• Matching
• Query language
• SQL
• Decomposition method
• Computer languages
• Constraint programming
• Computing

LP-based Heuristics for Cost-optimal Planning

Source URL: ai.cs.unibas.ch

• Software engineering
• Convex optimization
• Constraint programming
• Heuristic function
• Computer programming
• Mathematical optimization
• Heuristic
• Admissible heuristic
• Linear programming
• Operations research
• Heuristics
• Mathematics

Principles of Constraint Programming By Krzysztof R. Apt. Cambridge University Press, Cambridge, 2003. GBPxii + 407 pp., hardcover. ISBNConstraint Processing By Rina Dechter. Morgan Kaufmann Publi

Source URL: www.ics.uci.edu

• Computing
• Constraint satisfaction
• Local consistency
• Constraint optimization
• Mathematical optimization
• Lagrange multiplier
• Constraint
• Linear programming
• SCIP
• Constraint programming
• Software engineering
• Computer programming

J Glob Optim:327–345 DOIs10898A scaling algorithm for polynomial constraint satisfaction problems Ferenc Domes · Arnold Neumaier

Source URL: www.mat.univie.ac.at

• Abstract algebra
• Convex optimization
• Operations research
• Eigenvalues and eigenvectors
• Singular value decomposition
• Vector space
• Linear programming
• Matrix
• Linear least squares
• Algebra
• Mathematics
• Linear algebra

Range and Roots: Two Common Patterns for Specifying and Propagating Counting and Occurrence Constraints∗ Christian Bessiere LIRMM, CNRS and U. Montpellier

Source URL: homepages.laas.fr

• Computing
• Local consistency
• Constraint satisfaction problem
• Constraint satisfaction
• Maximum flow problem
• Constraint inference
• Constraint programming
• Software engineering
• Computer programming

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

The Thousand Faces of Constraint Propagation Emmanuel Hebrard Toulouse

Source URL: homepages.laas.fr

• Mathematical optimization
• Constraint satisfaction problem
• Constraint satisfaction
• Local consistency
• Decomposition method
• Linear programming relaxation
• Constraint programming
• Software engineering
• Computer programming