Sciweavers

1456 search results - page 9 / 292
» Improved Randomized Results for That Interval Selection Prob...
Sort
View
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 7 months ago
Improved Squeaky Wheel Optimisation for Driver Scheduling
Abstract. This paper presents a technique called Improved Squeaky Wheel Optimisation (ISWO) for driver scheduling problems. It improves the original Squeaky Wheel Optimisation'...
Uwe Aickelin, Edmund K. Burke, Jingpeng Li
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
14 years 7 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
JCSS
2002
199views more  JCSS 2002»
13 years 6 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
TSP
2010
13 years 1 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
ISCI
2010
118views more  ISCI 2010»
13 years 5 months ago
Approximations of upper and lower probabilities by measurable selections
A random set can be regarded as the result of the imprecise observation of a random variable. Following this interpretation, we study to which extent the upper and lower probabili...
Enrique Miranda, Inés Couso, Pedro Gil