![]() ![]() More generally, all some-to-many mappings of a uniform search space result in a new search space where the chance of doing better than p is 50-50. ![]() If the probability of finding a target in a search space is p, then the problem of finding the target in any subset of the search space is p. The assumption is conserved under mapping. An underlying foundation of COI is Bernoulli's Principle of Insufficient Reason(PrOIR) which imposes of a uniform distribution on a search space in the absence of all prior knowledge about the search target or the search space structure. In consequence, some have questioned the significance of COI to the performance of search algorithms. Yet in practice some searches appear to outperform others. Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. ![]()
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |