455 search results - page 89 / 91 » Approximation Algorithms for Partial Covering Problems |
ATAL
2009
Springer
13 years 12 months ago
2009
Springer
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Book
"Gaussian processes (GPs) provide a principled, practical, probabilistic approach to learning in kernel machines. GPs have received increased attention in the machine-learning...
ALT
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
SIAMJO
2002
13 years 5 months ago
2002
We study a class of generalized bundle methods for which the stabilizing term can be any closed convex function satisfying certain properties. This setting covers several algorithm...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We study an extension of the "standard" learning models to settings where observing the value of an attribute has an associated cost (which might be different for differ...