10054 search results - page 179 / 2011 » On the Complexity of Function Learning |
91
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
104
Voted
COMPLEX
2009
Springer
15 years 7 months ago
2009
Springer
In this article we evaluate an epidemic algorithm for the synchronization of coupled Kuramoto oscillators in complex Peer-to-Peer topologies. The algorithm requires a periodic coup...
107
Voted
COLING
2010
14 years 7 months ago
2010
Machine-learned ranking techniques automatically learn a complex document ranking function given training data. These techniques have demonstrated the effectiveness and flexibilit...
97
Voted
CG
2002
Springer
15 years 16 days ago
2002
Springer
The difficulty to write successful 19x19 go programs lies not only in the combinatorial complexity of go but also in the complexity of designing a good evaluation function containi...
95
Voted
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Circumscription is one of the most important formalisms for reasoning with incomplete information. It is equivalent to reasoning under the extended closed world assumption, which a...