534 search results - page 75 / 107 » Efficient polynomial L-approximations |
AIPS
2010
13 years 10 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
We propose a well-founded method of ranking a pool of m trained classifiers by their suitability for the current input of n instances. It can be used when dynamically selecting a s...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Weighted voting games are a popular model of collaboration in multiagent systems. In such games, each agent has a weight (intuitively corresponding to resources he can co...
EVOW
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Many efforts have been involved in association study of quantitative phenotypes and expressed genes. The key issue is how to efficiently identify phenotype-associated gen...