![]() |
|||||||
| [ Home ] | [ Software ] | [ Curriculum ] | [ Hardware ] | [ Community ] | [ News ] | [ Publications ] | [ Search ] |
|
No Free Lunch TheoremThe No Free Lunch Theorem states that for any search strategy, there is a problem space for which there is a better strategy. Ironically, therefore, no search mechanism is better than random search for all possible search spaces. Luckily, the real world is not any old possible search space---it has a particular structure. Another reason to study robots. -DSB |
| [ Home ] | [ Software ] | [ Curriculum ] | [ Hardware ] | [ Community ] | [ News ] | [ Publications ] | [ Search ] |
View Wiki Source | Edit Wiki Source | Mail Webmaster | |||||||