Sciweavers

6142 search results - page 129 / 1229
» The Complexity of Partition Functions
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
DATE
2010
IEEE
190views Hardware» more  DATE 2010»
15 years 3 months ago
AUTOSAR basic software for complex control units
— Dirk Diekhoff, Elektrobit Automotive "The development of complex control units requires mature and reliable basic software as well as integration support particularly in e...
Dirk Diekhoff
CADE
1992
Springer
15 years 2 months ago
Polynomial Interpretations and the Complexity of Algorithms
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
Adam Cichon, Pierre Lescanne
ACL
1996
14 years 11 months ago
Processing Complex Sentences in the Centering Framework
We extend the centering model for the resolution of intia-sentential anaphora and specify how to handle complex sentences. An empirical evaluation indicates that the functional in...
Michael Strube
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
15 years 4 months ago
A Generalization of Proximity Functions for K-Means
K-means is a widely used partitional clustering method. A large amount of effort has been made on finding better proximity (distance) functions for K-means. However, the common c...
Junjie Wu, Hui Xiong, Jian Chen, Wenjun Zhou