1939 search results - page 193 / 388 » Dynamic Lex Constraints |
163
click to vote
PEPM
1993
ACM
15 years 8 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...
119
click to vote
ASPDAC
2007
ACM
15 years 8 months ago
2007
ACM
- Current industry trends in system design -- multiple clocks, clocks with arbitrary frequency ratios, multi-phased clocks, gated clocks, and level-sensitive latches, combined with...
155
click to vote
GCC
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we present Amadeus, which is a holistic service-oriented environment for QoS-aware Grid workflows. Amadeus considers user's requirements, in terms of QoS constr...
131
click to vote
EOR
2008
15 years 4 months ago
2008
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
151
click to vote
EOR
2008
15 years 4 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...