7150 search results - page 128 / 1430 » An Approximation Algorithm for Approximation Rank |
127
Voted
CPM
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
128
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We present a series of results providing evidence that the incentive problem with VCG-based mechanisms is not very severe. Our first result uses average-case analysis to show that ...
112
click to vote
ADHOC
2010
15 years 2 months ago
2010
We investigate the problem of sleep/wake scheduling for low duty cycle sensor networks. Our work differs from prior work in that we explicitly consider the effect of synchronizati...
115
click to vote
DAM
2008
15 years 2 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...
150
Voted
COMBINATORICA
2010
14 years 9 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...