13841 search results - page 253 / 2769 » Algorithms and Constraint Programming |
178
click to vote
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
132
click to vote
ANOR
2002
15 years 6 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
199
click to vote
AUTOMATICA
2010
15 years 5 months ago
2010
Finite-time optimal control problems with quadratic performance index for linear systems with linear constraints can be transformed into Quadratic Programs (QPs). Model Predictive ...
153
click to vote
SAS
2007
Springer
16 years 22 days ago
2007
Springer
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
148
click to vote
RTAS
1996
IEEE
15 years 10 months ago
1996
IEEE
Real-time programmers have to deal with the problem of relating timing constraints associated with source code to sequences of machine instructions. This paper describes an enviro...