1166 search results - page 25 / 234 » Negotiating Using Rewards |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
ECRA
2010
13 years 9 months ago
2010
Meeting client Quality-of-Service (QoS) expectations proves to be a difficult task for the providers of e-Commerce services, especially when web servers experience overload condit...
ATAL
2008
Springer
13 years 11 months ago
2008
Springer
Reward shaping is a well-known technique applied to help reinforcement-learning agents converge more quickly to nearoptimal behavior. In this paper, we introduce social reward sha...
CEC
2007
IEEE
14 years 3 months ago
2007
IEEE
— This paper designed and developed negotiation agents with the distinguishing features of 1) conducting continuous time negotiation rather than discrete time negotiation, 2) lea...