An Economics Approach to Hard Computational Problems

An Economics Approach to Hard Computational Problems

A general method for combining existing algorithms into new programs that are unequivocally preferable to any of the component algorithms in 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....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Science (American Association for the Advancement of Science) 1997-01, Vol.275 (5296), p.51-54
Hauptverfasser: Huberman, Bernardo A., Lukose, Rajan M., Hogg, Tad
Format: Artikel
Sprache:eng
Schlagworte:
Access time
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Computational complexity
Computational complexity (Machine theory)
Computer science
control theory
systems
Computers
Economic theory
Exact sciences and technology
Fractions
Heuristics
Mathematics
Molecular Biology
Operations Research
Probability
Theoretical computing
World Wide Web
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A general method for combining existing algorithms into new programs that are unequivocally preferable to any of the component algorithms in 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.
ISSN:0036-8075
1095-9203
DOI:10.1126/science.275.5296.51