563 search results - page 51 / 113 » Computing approximate PSD factorizations |
ESA
2009
Springer
14 years 4 months ago
2009
Springer
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
SODA
2004
ACM
13 years 11 months ago
2004
ACM
Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...
LION
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. The practical utility of optimization technologies is often impacted by factors that reflect how these tools are used in practice, including whether various real-world c...
COCOON
2011
Springer
12 years 9 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
SAC
2006
ACM
14 years 3 months ago
2006
ACM
In this paper, we present an efficient procedure for building a piecewise linear function approximation of the speed function of a processor with hierarchical memory structure. Th...