170 search results - page 15 / 34 » Solving Sparse Integer Linear Systems |
DAC
1997
ACM
14 years 1 months ago
1997
ACM
The “quadratic placement” methodology is rooted in [6] [14] [16] and is reputedly used in many commercial and in-house tools for placement of standard-cell and gate-array desi...
ICARCV
2008
IEEE
14 years 4 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
IPPS
1998
IEEE
14 years 1 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
NAA
2004
Springer
14 years 3 months ago
2004
Springer
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
WIOPT
2010
IEEE
13 years 7 months ago
2010
IEEE
We consider the resource allocation (RA) problem of maximizing the weighted sum of the minimal user rates (WSMR) of coordinated cells subject to a total power constraint at each ba...