Sciweavers

817 search results - page 66 / 164
» Exact solutions to linear programming problems
Sort
View
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
14 years 1 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky
DAM
2002
135views more  DAM 2002»
13 years 8 months ago
Matchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
Tongnyoul Yi, Katta G. Murty, Cosimo Spera
EUROGP
2004
Springer
106views Optimization» more  EUROGP 2004»
14 years 2 months ago
The Evolution of Concurrent Control Software Using Genetic Programming
Despite considerable progress in GP over the past 10 years, there are many outstanding challenges that need to be addressed before it will be widely deployed for developing useful ...
John Hart, Martin J. Shepperd
VECPAR
2004
Springer
14 years 2 months ago
Domain Decomposition Methods for PDE Constrained Optimization Problems
Abstract. Optimization problems constrained by nonlinear partial differential equations have been the focus of intense research in scientific computing lately. Current methods for...
Ernesto E. Prudencio, Richard H. Byrd, Xiao-Chuan ...
ICASSP
2010
IEEE
13 years 9 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...