2009 IEEE International Conference on
Systems, Man, and Cybernetics |
![]() |
Abstract
subset of the search space is p. 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. Consequently the chance of doing worse is 50-50. This result can be viewed as a confirming property of COI. The meaning and common misinterpretations of Bernoulli's PrOIR are also discussed. To properly assess the significance of the COI for search, one must completely identify the precise sources of information that affect search performance. This discussion leads to resolution of the seeming conflict between COI and the observation some search algorithms perform well on a large class of problems.