Sciweavers

1165 search results - page 46 / 233
» Effective linear programming based placement methods
Sort
View
SIAMJO
2011
13 years 3 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
UAI
2008
13 years 10 months ago
On Identifying Total Effects in the Presence of Latent Variables and Selection bias
Assume that cause-effect relationships between variables can be described as a directed acyclic graph and the corresponding linear structural equation model We consider the identi...
Manabu Kuroki, Zhihong Cai
SJ
2010
136views more  SJ 2010»
13 years 3 months ago
Optimizing the Migration to Future-Generation Passive Optical Networks (PON)
We study the upgrading problem of existing Passive Optical Networks (PONs) that need to increase their capacity at different points in time. Our method upgrades line rates and migr...
M. De Andrade, Massimo Tornatore, S. Sallent, Bisw...
GLVLSI
2006
IEEE
185views VLSI» more  GLVLSI 2006»
14 years 2 months ago
Application of fast SOCP based statistical sizing in the microprocessor design flow
In this paper we have applied statistical sizing in an industrial setting. Efficient implementation of the statistical sizing algorithm is achieved by utilizing a dedicated interi...
Murari Mani, Mahesh Sharma, Michael Orshansky
IPPS
2006
IEEE
14 years 2 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...