37 search results - page 7 / 8 » Learning algorithms for online principal-agent problems (and... |
MM
2006
ACM
14 years 7 days ago
2006
ACM
Automated annotation of digital pictures has been a highly challenging problem for computer scientists since the invention of computers. The capability of annotating pictures by c...
IWANN
1999
Springer
13 years 10 months ago
1999
Springer
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
SAC
2005
ACM
13 years 11 months ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
AAMAS
2007
Springer
13 years 6 months ago
2007
Springer
Abstract. In the multiagent meeting scheduling problem, agents negotiate with each other on behalf of their users to schedule meetings. While a number of negotiation approaches hav...
SDM
2010
SIAM
13 years 7 months ago
2010
SIAM
In recent years, matrix approximation for missing value prediction has emerged as an important problem in a variety of domains such as recommendation systems, e-commerce and onlin...