2861 search results - page 219 / 573 » Constraint Programming |
203
click to vote
ISPD
1997
ACM
15 years 10 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
208
click to vote
CADE
2001
Springer
16 years 6 months ago
2001
Springer
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
175
click to vote
ECOWS
2009
Springer
16 years 1 months ago
2009
Springer
—Current Web service composition approaches and languages such as WS-BPEL do not allow to define temporal constraints in a declarative and separate way. Also it is not possible ...
166
click to vote
COMPSAC
2005
IEEE
16 years 2 days ago
2005
IEEE
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs goalorient...
388
click to vote
ICAL
2011
14 years 6 months ago
2011
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...