Sciweavers

2278 search results - page 329 / 456
» Markov logic networks
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Reinforcement learning in the presence of rare events
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
Jordan Frank, Shie Mannor, Doina Precup
CHI
2006
ACM
16 years 6 months ago
Quantifying interpersonal influence in face-to-face conversations based on visual attention patterns
A novel measure for automatically quantifying the amount of interpersonal influence present in face-toface conversations is proposed based on the visualattention patterns of the p...
Kazuhiro Otsuka, Junji Yamato, Yoshinao Takemae, H...
INFOCOM
2009
IEEE
16 years 1 months ago
The Impact of Mobility on Gossip Algorithms
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
Anand D. Sarwate, Alexandros G. Dimakis
SIGECOM
2009
ACM
114views ECommerce» more  SIGECOM 2009»
16 years 26 days ago
Policy teaching through reward function learning
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...
Haoqi Zhang, David C. Parkes, Yiling Chen
CISS
2008
IEEE
16 years 25 days ago
Achievable rates and training optimization for fading relay channels with memory
—In this paper, transmission over time-selective, flat fading relay channels is studied. It is assumed that channel fading coefficients are not known a priori. Transmission tak...
Sami Akin, Mustafa Cenk Gursoy