13414 search results - page 2488 / 2683 » The distributed boosting algorithm |
188
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Given a set P of products, a set O of customers, and a product p P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P t...
154
click to vote
COCO
2009
Springer
15 years 10 months ago
2009
Springer
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
180
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
164
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working ...
156
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we incorporate autonomous agents' capability to perform parallel interactions into the cooperative search model, resulting in a new method which outperforms the...