3875 search results - page 451 / 775 » Approximation algorithms for the 0-extension problem |
190
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
191
click to vote
ORL
2006
15 years 6 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...
181
click to vote
KDD
2003
ACM
16 years 7 months ago
2003
ACM
Several important time series data mining problems reduce to the core task of finding approximately repeated subsequences in a longer time series. In an earlier work, we formalize...
211
click to vote
WINE
2007
Springer
16 years 25 days ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
184
click to vote
NIPS
2007
15 years 8 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...