Sciweavers

88 search results - page 15 / 18
» Improved Bounds and Schemes for the Declustering Problem
Sort
View
CDC
2008
IEEE
124views Control Systems» more  CDC 2008»
14 years 1 months ago
A proximal center-based decomposition method for multi-agent convex optimization
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
Ion Necoara, Johan A. K. Suykens
ICASSP
2011
IEEE
12 years 10 months ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor
JSAC
2006
146views more  JSAC 2006»
13 years 7 months ago
Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks
Multihop infrastructure wireless mesh networks offer increased reliability, coverage, and reduced equipment costs over their single-hop counterpart, wireless local area networks. E...
Mansoor Alicherry, Randeep Bhatia, Erran L. Li
TCAD
2008
136views more  TCAD 2008»
13 years 6 months ago
A Geometric Programming-Based Worst Case Gate Sizing Method Incorporating Spatial Correlation
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
Jaskirat Singh, Zhi-Quan Luo, Sachin S. Sapatnekar
DAM
2007
177views more  DAM 2007»
13 years 7 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim