31 search results - page 2 / 7 » dis 2009 |
114
Voted
DIS
2009
Springer
15 years 10 months ago
2009
Springer
We present an active learning scheme that exploits cluster structure in data.
60
Voted
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
256
Voted
CP
2009
Springer
16 years 4 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
104
Voted
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
132
Voted
DIS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We propose a new boosting algorithm based on a linear programming formulation. Our algorithm can take advantage of the sparsity of the solution of the underlying optimiza...