36 search results - page 3 / 8 » Tight Approximability Results for the Maximum Solution Equat... |
FOCS
2007
IEEE
14 years 15 days ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
CDC
2009
IEEE
13 years 4 months ago
2009
IEEE
Abstract-- Lifetime maximization is an important optimization problem specific to Wireless Sensor Networks (WSNs) since they operate with limited energy resources which are therefo...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
DAM
2008
13 years 6 months ago
2008
We investigate the Semidefinite Programming based Sums of squares (SOS) decomposition method, designed for global optimization of polynomials, in the context of the (Maximum) Sati...
NETWORKS
2007
13 years 5 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...