133 search results - page 24 / 27 » Approximation bounds for Black Hole Search problems |
161
click to vote
ALENEX
2009
15 years 3 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
185
click to vote
JMLR
2008
15 years 5 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
177
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
171
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
155
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
The challenge we address is to reason about projected resource usage within a hierarchical task execution framework in order to improve agent effectiveness. Specifically, we seek ...