2974 search results - page 267 / 595 » Model-Driven Constraint Programming |
149
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper, we cast discriminative training problems into standard linear programming (LP) optimization. Besides being convex and having globally optimal solution(s), LP progra...
174
click to vote
RTAS
2007
IEEE
16 years 26 days 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...
170
click to vote
TACAS
2007
Springer
16 years 21 days 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 ...
152
click to vote
SAS
2005
Springer
16 years 2 days 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...
163
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...