480 search results - page 57 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
ICCAD
1993
IEEE
14 years 1 months ago
1993
IEEE
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
QEST
2008
IEEE
14 years 3 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We present an iterative approximate solution to the multidimensional assignment problem under general cost functions. The method maintains a feasible solution at every step, and i...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
ICML
2006
IEEE
14 years 10 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...