4377 search results - page 627 / 876 » Mass problems and randomness |
179
click to vote
CP
1995
Springer
15 years 10 months ago
1995
Springer
We present a new heuristic approach for maximal constraint satisfaction of overconstrained problems (MAX-CSP). This approach is based on a formulation of CSP as an optimization pro...
132
click to vote
AAAI
2008
15 years 9 months ago
2008
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
189
Voted
AIPS
2007
15 years 9 months ago
2007
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from sce...
168
click to vote
ISQED
2010
IEEE
15 years 8 months ago
2010
IEEE
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...
224
click to vote
CVPR
2005
IEEE
15 years 8 months ago
2005
IEEE
We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurio...