No Free Lunch in Search and Optimization
Uitgelicht
|
30,73 |
Naar shop
|
|
30,73 |
Naar shop
|
|
136,00 |
Naar shop
|
Beschrijving
Bol
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computing, there are circumstances in which the outputs of all procedures solving a particular type of problem are statistically identical. A colorful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of search and optimization, is to say that there is no free lunch. Wolpert had previously derived no free lunch theorems for machine learning . Before Wolpert's article was published, Cullen Schaffer had summarized a preprint version of this work of Wolpert's, but used different terminology.
Beschrijving
(2)
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computing, there are circumstances in which the outputs of all procedures solving a particular type of problem are statistically identical. A colorful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of search and optimization, is to say that there is no free lunch. Wolpert had previously derived no free lunch theorems for machine learning . Before Wolpert's article was published, Cullen Schaffer had summarized a preprint version of this work of Wolpert's, but used different terminology.
AmazonPagina's: 76, Paperback, Betascript Publishers
ProductspecificatiesPrijzen voor het laatst bijgewerkt op:
Gerelateerde producten
