1647 search results - page 68 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
130
Voted
AAIM
2010
Springer
15 years 8 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
148
Voted
WWW
2006
ACM
16 years 5 months ago
2006
ACM
We revisit a problem introduced by Bharat and Broder almost a decade ago: how to sample random pages from the corpus of documents indexed by a search engine, using only the search...
136
click to vote
EOR
2010
15 years 2 months ago
2010
: We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedu...
112
Voted
SODA
2010
ACM
16 years 2 months ago
2010
ACM
We design and analyze an on-line reordering buffer management algorithm with improved O log k log log k competitive ratio for non-uniform costs, where k is the buffer size. This i...
134
Voted
DAM
2008
15 years 4 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...