Sciweavers

54 search results - page 8 / 11
» The document as an ergodic markov chain
Sort
View
AAMAS
2007
Springer
14 years 1 months ago
Networks of Learning Automata and Limiting Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is that...
Peter Vrancx, Katja Verbeeck, Ann Nowé
BC
2008
134views more  BC 2008»
13 years 7 months ago
Interacting with an artificial partner: modeling the role of emotional aspects
In this paper we introduce a simple model based on probabilistic finite state automata to describe an emotional interaction between a robot and a human user, or between simulated a...
Isabella Cattinelli, Massimiliano Goldwurm, N. Alb...
JCIT
2010
156views more  JCIT 2010»
13 years 2 months ago
An M/G/1 Retrial Queue with Priority, Balking and Feedback Customers
We consider an M/G/1 queue with general retrial times where the blocked customers may balk the system, or join the priority queue, or enter the orbit. As soon as a customer is ser...
Peishu Chen, Yijuan Zhu
CVPR
2009
IEEE
14 years 2 months ago
Random walks on graphs to model saliency in images
We formulate the problem of salient region detection in images as Markov random walks performed on images represented as graphs. While the global properties of the image are extra...
Viswanath Gopalakrishnan, Yiqun Hu, Deepu Rajan
STACS
2012
Springer
12 years 3 months ago
Stabilization of Branching Queueing Networks
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...
Tomás Brázdil, Stefan Kiefer