2957 search results - page 366 / 592 » The Complexity of Polynomial-Time Approximation |
187
click to vote
ATAL
2005
Springer
16 years 2 days ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
157
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
189
click to vote
ECAI
2004
Springer
15 years 12 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
206
click to vote
SSPR
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In surveillance systems for monitoring people behaviour, it is imporant to build systems that can adapt to the signatures of the people tasks and movements in the environ...
179
click to vote
CPM
2004
Springer
15 years 10 months ago
2004
Springer
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...