Sciweavers

7129 search results - page 489 / 1426
» Approximation Algorithms for Treewidth
Sort
View
CDC
2009
IEEE
157views Control Systems» more  CDC 2009»
15 years 10 months ago
A PDE viewpoint on basic properties of coordination algorithms with symmetries
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with res...
Alain Sarlette, Rodolphe Sepulchre
ISPD
1998
ACM
99views Hardware» more  ISPD 1998»
15 years 10 months ago
New efficient algorithms for computing effective capacitance
We describe a novel iterationless approach for computing the effective capacitance of an interconnect load at a driving gate output. Our new approach is considerably faster than p...
Andrew B. Kahng, Sudhakar Muddu
ICASSP
2011
IEEE
14 years 10 months ago
Robust binary least squares: Relaxations and algorithms
Finding the least squares (LS) solution s to a system of linear equations Hs = y where H, y are given and s is a vector of binary variables, is a well known NP-hard problem. In th...
Efthymios Tsakonas, Joakim Jalden, Björn E. O...
CDC
2008
IEEE
127views Control Systems» more  CDC 2008»
16 years 1 months ago
Distributed control: A sequentially semi-separable approach
— We consider the problem of designing controllers for spatially-varying interconnected systems distributed in one spatial dimension. The matrix structure of such systems can be ...
Justin K. Rice, Michel Verhaegen
GLOBECOM
2006
IEEE
16 years 22 days ago
Throughput Guarantees for Wireless Networks with Opportunistic Scheduling
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
Vegard Hassel, Geir E. Øien, David Gesbert