O. Etzioni, S. Hanks, T. Jiang, R. Karp, O. Madani, O. Waarts, Optimal information gathering on the internet with time and cost constraints, in: Proc. 37th IEEE Symposium on Foundations of Computer Science (FOCS), Burlington, VT, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
BIG: A Resource-Bounded Information Gathering Agent - Lesser, Horling, Klassner, .. (1998) (4 citations) (Correct)
....of gathered information to drive further gathering activities, its bottom up and top down directed processing, and its explicit representation of sources of uncertainty associated with both inferred and extracted information. Our time quality cost trade off approach is similar to formal methods (Etzioni et al. 1996) for reasoning about gathering information, except that our trade off analysis focuses on problem solving actions (including text processing) and other agent activities rather than simply focusing on the trade offs of different information resources, i.e. our work addresses both agent control ....
Etzioni, O.; Hanks, S.; Jiang, T.; Karp, R.; Madani, O.; and Waarts, O. 1996. Optimal information gathering on the internet with time and cost constraints. In Proceedings of the Thirty-seventh IEEE Symposium on Foundations of Computer Science (FOCS).
Efficient Information Gathering on the Internet.. - Etzioni, Hanks.. (1996) (Correct)
....running in time O(kn 2 ) The algorithm is based on the ratio 1 2 algorithm for single batchschedules, but it also involves some new ideas. Due to lack of space, most proofs are omitted or only sketched. The proofs for the cost model appear in [2] and those for the reward model appear in [1]. 1.2 Related Work Scheduling problems have been studied in manycontexts including scheduling on parallel machines, processor allocation, etc. see [8] for a survey) Our Internet inspired query scheduling problem has a unique flavor, however, due to the need to balance the competing time and ....
O. Etzioni, S. Hanks, T. Jiang and O. Madani. Optimal Information Gathering on the Internet with Time and Cost Constraints. Manuscript 1996.
BIG: A Resource-Bounded Information Gathering and.. - Lesser, Horling.. (1998) (1 citation) (Correct)
....like TSIMMIS [18] SIMS [2] and the Information Manifold [33] but differs in that its focus is on resource bounded information extraction and assimilation coupled with discovery. The time quality cost trade off aspect of our work is conceptually akin to [20, 19, 9, 36] and formal methods [16] for reasoning about gathering information, except that our trade off analysis focuses on problem solving actions (including text processing) and other agent activities rather than focusing on the trade offs of different information resources, i.e. our work addresses both agent control level and ....
Oren Etzioni, Steve Hanks, Tao Jiang, Richard Karp, Omid Madani, and Orli Waarts. Optimal information gathering on the internet with time and cost constraints. In Proceedings of the Thirty-seventh IEEE Symposium on Foundations of Computer Science (FOCS), Burlington, VT, October 1996.
A Next Generation Information Gathering Agent - Lesser, Horling, Klassner.. (1998) (2 citations) (Correct)
....information to drive further gathering activities, its bottom up and top down directed processing, and its explicit representation of sources of uncertainty associated with both inferred and extracted information. The time quality cost trade off aspect of our work is similar to formal methods [14] for reasoning about gathering information, except that our tradeoff analysis focuses on problem solving actions (including text processing) and other agent activities rather than simply focusing on the trade offs of different information resources, i.e. our work addresses both agent control ....
Oren Etzioni, Steve Hanks, Tao Jiang, Richard Karp, Omid Madani, and Orli Waarts. Optimal information gathering on the internet with time and cost constraints. In Proceedings of the Thirty-seventh IEEE Symposium on Foundations of Computer Science (FOCS), Burlington, VT, October 1996.
Efficient Information Gathering on the Internet.. - Etzioni, Hanks.. (Correct)
....running in time O(kn 2 ) The algorithm is based on the ratio 1 2 algorithm for single batch schedules, but it also involves some new ideas. Due to lack of space, most proofs are omitted or only sketched. The proofs for the cost model appear in [2] and those for the reward model appear in [1]. 1.2 Related Work Scheduling problems have been studied in many contexts including scheduling on parallel machines, processor allocation, etc. see [8] for a survey) Our Internet inspired query scheduling problem has a unique flavor, however, due to the need to balance the competing time and ....
O. Etzioni, S. Hanks, T. Jiang and O. Madani. Optimal Information Gathering on the Internet with Time and Cost Constraints. Manuscript 1996.
BIG: An agent for resource-bounded information.. - Lesser, Horling.. (2000) (6 citations) (Correct)
No context found.
O. Etzioni, S. Hanks, T. Jiang, R. Karp, O. Madani, O. Waarts, Optimal information gathering on the internet with time and cost constraints, in: Proc. 37th IEEE Symposium on Foundations of Computer Science (FOCS), Burlington, VT, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC