5372 search results - page 1030 / 1075 » complexity 2007 |
144
click to vote
ASIACRYPT
2007
Springer
15 years 10 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
138
Voted
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are a popular approach for modeling multi-agent systems acting in uncertain domains. Given the signi...
130
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper proposes the β-WoLF algorithm for multiagent reinforcement learning (MARL) in the stochastic games framework that uses an additional “advice” signal to inform agen...
151
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Activity recognition is a key component for creating intelligent, multi-agent systems. Intrinsically, activity recognition is a temporal classification problem. In this paper, we...
138
click to vote
ATVA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...