1647 search results - page 149 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
141
click to vote
SODA
1994
ACM
15 years 6 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...
124
click to vote
ISSAC
2007
Springer
15 years 11 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
143
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
Consider a robust downlink beamforming optimization problem for secondary multicast transmission in a multiple-input multiple-output (MIMO) spectrum sharing cognitive radio (CR) n...
142
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
147
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...