2864 search results - page 269 / 573 » Constraint Programming in OPL |
181
click to vote
PEPM
1993
ACM
15 years 9 months ago
1993
ACM
The aim of binding-time analysis is to determine when variables, expressions, statements, etc. in a program can be evaluated by classifying these into static (compile-time) and dy...
145
click to vote
PRL
2006
15 years 5 months ago
2006
To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible...
167
click to vote
PPDP
2010
Springer
15 years 3 months ago
2010
Springer
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
148
click to vote
LPNMR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
145
click to vote
ISIPTA
2003
IEEE
15 years 10 months ago
2003
IEEE
A second-order hierarchical uncertainty model of a system of independent random variables is studied in the paper. It is shown that the complex nonlinear optimization problem for ...