6142 search results - page 397 / 1229 » The Complexity of Partition Functions |
151
click to vote
NIPS
2000
15 years 8 months ago
2000
The Bayesian paradigm apparently only sometimes gives rise to Occam's Razor; at other times very large models perform well. We give simple examples of both kinds of behaviour...
174
click to vote
NIPS
1993
15 years 8 months ago
1993
This paper introduces GNARL, an evolutionary program which induces recurrent neural networks that are structurally unconstrained. In contrast to constructive and destructive algor...
174
click to vote
AIPS
2009
15 years 7 months ago
2009
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
323
click to vote
ICANN
2011
Springer
14 years 10 months ago
2011
Springer
The definition of appropriate kernel functions is crucial for the performance of a kernel method. In many of the state-of-the-art kernels for trees, matching substructures are con...
207
click to vote
LCTRTS
2010
Springer
16 years 1 months ago
2010
Springer
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...