Sciweavers

1483 search results - page 43 / 297
» Geometric constraint satisfaction using optimization methods
Sort
View
APPROX
2009
Springer
142views Algorithms» more  APPROX 2009»
15 years 6 months ago
Optimal Sherali-Adams Gaps from Pairwise Independence
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
Konstantinos Georgiou, Avner Magen, Madhur Tulsian...
SCALESPACE
1999
Springer
15 years 4 months ago
A Geometric Functional for Derivatives Approximation
We develop on estimation method, for the derivative field of an image based on Bayesian approach which is formulated in a geometric way. The Maximum probability configuration of ...
Nir A. Sochen, Robert M. Haralick, Yehoshua Y. Zee...
AI
2010
Springer
14 years 12 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
15 years 1 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
ICTAI
2009
IEEE
14 years 9 months ago
A Generalized Cyclic-Clustering Approach for Solving Structured CSPs
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
Cédric Pinto, Cyril Terrioux