2864 search results - page 256 / 573 » Constraint Programming in OPL |
151
click to vote
RTAS
2007
IEEE
15 years 11 months ago
2007
IEEE
Discrete-event (DE) models are formal system specifications that have analyzable deterministic behaviors. Using a global, consistent notion of time, DE components communicate via...
149
click to vote
TACAS
2007
Springer
15 years 11 months ago
2007
Springer
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
134
click to vote
SAS
2005
Springer
15 years 11 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
145
click to vote
ISQED
2010
IEEE
15 years 7 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...
214
click to vote
CCE
2008
15 years 5 months ago
2008
Deterministic optimization approaches have been well developed and widely used in the process industry to accomplish off-line and on-line process optimization. The challenging tas...