Sciweavers

771 search results - page 102 / 155
» Markov Decision Processes with Arbitrary Reward Processes
Sort
View
CONCUR
2010
Springer
15 years 5 months ago
Parameterized Verification of Ad Hoc Networks
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavat...
144
Voted
ATAL
2010
Springer
15 years 5 months ago
Planning against fictitious players in repeated normal form games
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
Enrique Munoz de Cote, Nicholas R. Jennings
ATAL
2007
Springer
15 years 10 months ago
Letting loose a SPIDER on a network of POMDPs: generating quality guaranteed policies
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
Pradeep Varakantham, Janusz Marecki, Yuichi Yabu, ...
ATAL
2008
Springer
15 years 6 months ago
Not all agents are equal: scaling up distributed POMDPs for agent networks
Many applications of networks of agents, including mobile sensor networks, unmanned air vehicles, autonomous underwater vehicles, involve 100s of agents acting collaboratively und...
Janusz Marecki, Tapana Gupta, Pradeep Varakantham,...
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 4 months ago
Efficient ticket routing by resolution sequence mining
IT problem management calls for quick identification of resolvers to reported problems. The efficiency of this process highly depends on ticket routing--transferring problem ticke...
Qihong Shao, Yi Chen, Shu Tao, Xifeng Yan, Nikos A...