Sciweavers

403 search results - page 48 / 81
» Variable ranges in linear constraints
Sort
View
DISOPT
2007
155views more  DISOPT 2007»
13 years 9 months ago
Linear-programming design and analysis of fast algorithms for Max 2-CSP
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...
Alexander D. Scott, Gregory B. Sorkin
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 9 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
IJCAI
1989
13 years 11 months ago
Perturbation Analysis with Qualitative Models
Perturbation analysis deals with the relation­ ships between small changes in a system's inputs or model and changes in its outputs. Reverse simulation is of particular inte...
Renato de Mori, Robert Prager
ECCV
2008
Springer
14 years 11 months ago
Closed-Form Solution to Non-rigid 3D Surface Registration
Abstract. We present a closed-form solution to the problem of recovering the 3D shape of a non-rigid inelastic surface from 3D-to-2D correspondences. This lets us detect and recons...
Mathieu Salzmann, Francesc Moreno-Noguer, Vincent ...
AI
1999
Springer
13 years 9 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter