1647 search results - page 136 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
117
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a ...
158
click to vote
RCIS
2010
15 years 3 months ago
2010
—The strategies for mining frequent itemsets, which is the essential part of discovering association rules, have been widely studied over the last decade. In real-world datasets,...
140
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
146
Voted
LATIN
1998
Springer
15 years 9 months ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
236
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...