5595 search results - page 171 / 1119 » Approximation Algorithms for Clustering Problems |
144
Voted
AAIM
2008
Springer
15 years 7 months ago
2008
Springer
We give a randomized protocol for the classic cake cutting problem that guarantees approximate proportional fairness, and with high probability uses a linear number of cuts.
146
click to vote
PR
1998
15 years 4 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
126
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
142
click to vote
DFG
2009
Springer
15 years 11 months ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
315
Voted
INFOCOM
2012
IEEE
13 years 7 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...