1647 search results - page 35 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
107
Voted
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
117
click to vote
TCC
2007
Springer
15 years 8 months ago
2007
Springer
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
113
click to vote
ICML
1999
IEEE
16 years 3 months ago
1999
IEEE
Most machine learning algorithms share the following drawback: they only output bare predictions but not the con dence in those predictions. In the 1960s algorithmic information t...
123
click to vote
ANOR
2004
15 years 2 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
128
click to vote
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We revisit the online unit clustering problem in one dimension which we recently introduced at WAOA'06: given a sequence of n points on the line, the objective is to...