2957 search results - page 265 / 592 » The Complexity of Polynomial-Time Approximation |
171
Voted
ATAL
2004
Springer
16 years 2 days ago
2004
Springer
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
245
click to vote
ICTAI
2003
IEEE
15 years 12 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
225
Voted
SPAA
2010
ACM
15 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
178
click to vote
ISCAS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
186
Voted
AIPS
2007
15 years 9 months ago
2007
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...