6142 search results - page 144 / 1229 » The Complexity of Partition Functions |
ATAL
2007
Springer
15 years 4 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
CG
2002
Springer
14 years 10 months 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...
LPNMR
2009
Springer
15 years 4 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...
EUROCOLT
1995
Springer
15 years 1 months ago
1995
Springer
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
BIOSYSTEMS
2007
14 years 10 months ago
2007
The structural organization of biological systems is one of nature’s most fascinating aspects, but its origin and functional role is not yet fully understood. For instance, basi...