Sciweavers

206 search results - page 39 / 42
» A branch-and-bound algorithm for hard multiple knapsack prob...
Sort
View
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
15 years 3 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami
CIKM
2004
Springer
15 years 3 months ago
Local methods for estimating pagerank values
The Google search engine uses a method called PageRank, together with term-based and other ranking techniques, to order search results returned to the user. PageRank uses link ana...
Yen-Yu Chen, Qingqing Gan, Torsten Suel
CIKM
2010
Springer
14 years 8 months ago
Learning to rank relevant and novel documents through user feedback
We consider the problem of learning to rank relevant and novel documents so as to directly maximize a performance metric called Expected Global Utility (EGU), which has several de...
Abhimanyu Lad, Yiming Yang
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
13 years 8 hour ago
Learning from crowds in the presence of schools of thought
Crowdsourcing has recently become popular among machine learning researchers and social scientists as an effective way to collect large-scale experimental data from distributed w...
Yuandong Tian, Jun Zhu
GIS
2005
ACM
15 years 10 months ago
Close pair queries in moving object databases
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query...
Panfeng Zhou, Donghui Zhang, Betty Salzberg, Gene ...