5624 search results - page 523 / 1125 » On Conditional Covering Problem |
181
click to vote
TSP
2010
15 years 1 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
162
click to vote
DAC
2006
ACM
16 years 8 months ago
2006
ACM
In a placed circuit, there are a lot of movable cells that can be flipped to further reduce the total wirelength, without affecting the original placement solution. We aim at solv...
217
click to vote
JCM
2007
15 years 7 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...
254
click to vote
GIS
2004
ACM
16 years 8 months ago
2004
ACM
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
176
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...