Huberman BA, Lukose RM, Hogg T
Dynamics of Computation Group, Xerox Palo Alto Research Center, Palo Alto, CA 94304, USA.
Science. 1997 Jan 3;275(5296):51-4. doi: 10.1126/science.275.5296.51.
A general method for combining existing algorithms into new programs that are unequivocally preferable to any of the component algorithms is presented. This method, based on notions of risk in economics, offers a computational portfolio design procedure that can be used for a wide range of problems. Tested by solving a canonical NP-complete problem, the method can be used for problems ranging from the combinatorics of DNA sequencing to the completion of tasks in environments with resource contention, such as the World Wide Web.
提出了一种将现有算法组合成新程序的通用方法，这些新程序无疑比任何组件算法都更可取。该方法基于经济学中的风险概念，提供了一种计算投资组合设计程序，可用于解决广泛的问题。通过解决一个典型的NP完全问题进行测试，该方法可用于从DNA测序的组合问题到资源竞争环境（如万维网）中的任务完成等各种问题。
