1806 search results - page 95 / 362 » Some Functions Computable with a Fused-Mac |
142
Voted
CG
2006
Springer
15 years 9 months ago
2006
Springer
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
161
click to vote
ECML
2006
Springer
15 years 9 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...
156
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
XCSF is a novel version of learning classifier systems (LCS) which extends the typical concept of LCS by introducing computable classifier prediction. In XCSF Classifier predictio...
164
click to vote
CATS
2006
15 years 7 months ago
2006
The busy beaver is an example of a function which is not computable. It is based on a particular class of Turing machines, and is defined as the largest number of 1's that ca...
181
click to vote
SOCA
2010
IEEE
15 years 3 months ago
2010
IEEE
The availability of Web services with similar functionality but different QoS values creates new challenges for Web services composition: not only functional properties of the comp...