706 search results - page 82 / 142 » Super Solutions in Constraint Programming |
CPAIOR
2004
Springer
15 years 5 months ago
2004
Springer
We discuss a di cult optimization problem on a chess-board, requiring equal numbers of black and white queens to be placed on the board so that the white queens cannot attack the b...
SIAMJO
2010
14 years 6 months ago
2010
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
ICLP
2010
Springer
15 years 3 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...
114
click to vote
TCAD
2008
14 years 11 months ago
2008
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Graph cuts have proven useful for image segmentation and for volumetric reconstruction in multiple view stereo. However, solutions are biased: the cost function tends to favour ei...