Optimal Information Gathering on the Internet with Time and Cost Constraints
From MaRDI portal
Publication:4943885
DOI10.1137/S0097539797314465zbMath0949.68006MaRDI QIDQ4943885
Omid Madani, Oren Etzioni, Tao Jiang, Steve Hanks
Publication date: 19 March 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
computational complexityschedulingInternetapproximation algorithminformation retrievalWorld Wide Webinformation gatheringbatched policytime and cost trade off
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35) Parallel algorithms in computer science (68W10)
Related Items (1)
This page was built for publication: Optimal Information Gathering on the Internet with Time and Cost Constraints