Sciweavers

2861 search results - page 287 / 573
» Constraint Programming
Sort
View
DAC
2007
ACM
16 years 7 months ago
Fast Min-Cost Buffer Insertion under Process Variations
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes mo...
Ruiming Chen, Hai Zhou
CPAIOR
2009
Springer
16 years 1 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
15 years 6 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
POPL
2002
ACM
16 years 6 months ago
Functional logic overloading
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
Matthias Neubauer, Peter Thiemann, Martin Gasbichl...
SODA
2010
ACM
133views Algorithms» more  SODA 2010»
16 years 4 months ago
Testing additive integrality gaps
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...
Friedrich Eisenbrand, Nicolai Hähnle, Dömötör ...