5580 search results - page 833 / 1116 » Randomized priority algorithms |
142
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
109
click to vote
BMCBI
2008
15 years 3 months ago
2008
Background: The rapid growth of biomedical literature presents challenges for automatic text processing, and one of the challenges is abbreviation identification. The presence of ...
146
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
164
click to vote
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
155
click to vote
ATAL
2011
Springer
14 years 3 months ago
2011
Springer
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...