644 search results - page 92 / 129 » Decomposition Complexity |
ICML
2003
IEEE
16 years 1 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
94
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...
215
click to vote
ECOOP
2009
Springer
16 years 1 months ago
2009
Springer
Refactoring tools allow the programmer to pretend they are working with a richer language where the behaviour of a program is automatically preserved during restructuring. In this ...
118
Voted
DCC
2008
IEEE
16 years 4 days ago
2008
IEEE
This paper investigates the design and application of the optimal filter banks for a predictioncompensated multiple description coding (PC-MDC) scheme, where the coefficients in e...
87
Voted
SODA
2010
ACM
15 years 10 months ago
2010
ACM
A monotone distribution P over a (partially) ordered domain assigns higher probability to y than to x if y x in the order. We study several natural problems concerning testing pr...