Sciweavers

682 search results - page 86 / 137
» One-Counter Markov Decision Processes
Sort
View
86
Voted
ICIP
2008
IEEE
15 years 7 months ago
A new theoretic framework for cross-layer optimization
Cross-layer optimization aims at improving the performance of network users operating in a time-varying, error-prone wireless environment. However, current solutions often rely on...
Fangwen Fu, Mihaela van der Schaar
105
Voted
SBMF
2009
Springer
126views Formal Methods» more  SBMF 2009»
15 years 5 months ago
Undecidability Results for Distributed Probabilistic Systems
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
Sergio Giro
92
Voted
KDD
2008
ACM
142views Data Mining» more  KDD 2008»
16 years 1 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...
106
Voted
ATAL
2007
Springer
15 years 7 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, ...
120
Voted
ATAL
2008
Springer
15 years 2 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,...