1647 search results - page 156 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
151
click to vote
ICDM
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
122
Voted
CPM
2004
Springer
15 years 10 months ago
2004
Springer
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
171
Voted
FOCS
1999
IEEE
15 years 9 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
148
click to vote
BMCBI
2005
15 years 5 months ago
2005
Background: The inference of homology from statistically significant sequence similarity is a central issue in sequence alignments. So far the statistical distribution function un...
176
Voted
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...