234 search results - page 27 / 47 » The Complexity of Global Cardinality Constraints |
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
A steepest descent based bit allocation method with polynomial iteration complexity for minimizing the sum of frame distortions under a total bit rate constraint is presented for ...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—A new distributed estimation algorithm for tracking using a wireless sensor network is presented. We investigate how to track a time varying signal, noisily sensed by the nodes ...
TCS
2008
14 years 9 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 ...
RTAS
2010
IEEE
14 years 8 months ago
2010
IEEE
While most prior work on multiprocessor real-time scheduling focuses on independent tasks, dependencies due to non-preemptive sections, suspensions, and pipelinebased precedence c...