Sciweavers

227 search results - page 10 / 46
» Generalized multiagent learning with performance bound
Sort
View
TCC
2010
Springer
173views Cryptology» more  TCC 2010»
14 years 6 months ago
Bounds on the Sample Complexity for Private Learning and Private Data Release
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi N...
ICCV
2005
IEEE
14 years 2 months ago
Learning Models for Predicting Recognition Performance
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...
Rong Wang, Bir Bhanu
ATAL
2006
Springer
14 years 24 days ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
ALT
2008
Springer
14 years 6 months ago
Learning with Continuous Experts Using Drifting Games
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
Indraneel Mukherjee, Robert E. Schapire
ATAL
2006
Springer
14 years 24 days ago
Learning the required number of agents for complex tasks
Coordinating agents in a complex environment is a hard problem, but it can become even harder when certain characteristics of the tasks, like the required number of agents, are un...
Sébastien Paquet, Brahim Chaib-draa