Publication Date

12-2014

Comments

Technical Report: UTEP-CS-14-73

Abstract

Often, several different algorithms can solve a certain practical problem. Sometimes, algorithms which are successful in solving one problem can solve other problems as well. How can we decide which of the original algorithms is the most promising -- i.e., which is more probable to be able to solve other problem? In many cases, the simplest algorithms turns out to be the most successful. In this paper, we provide a possible explanation for this empirical observation.

Share

COinS