Optimal Information Gathering on the Internet with Time and Cost Constraints
- 1 January 2000
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 29 (5), 1596-1620
- https://doi.org/10.1137/s0097539797314465
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- NetBill: an Internet commerce system optimized for network-delivered servicesIEEE Wireless Communications, 1995
- Scheduling tasks with failure probabilities to minimize expected costNaval Research Logistics (NRL), 1990
- Minimizing costs of sequential and parallel personnel testing programsNaval Research Logistics Quarterly, 1982
- Optimal problem-solving search: All-or-none solutionsArtificial Intelligence, 1975
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975
- Optimal task sequencing with precedence constraintsDiscrete Mathematics, 1973
- Quiz show problemsJournal of Mathematical Analysis and Applications, 1969