Optimal demand-oriented topology for hypertext systems
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
BIG: a resource-bounded information gathering agent
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Query strategies for priced information (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A framework for expressing and combining preferences
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A Value-Driven System for Autonomous Information Gathering
Journal of Intelligent Information Systems
Multiobjective query optimization
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Barrier Trees on Poset-Valued Landscapes
Genetic Programming and Evolvable Machines
On preference-based search in state space graphs
Eighteenth national conference on Artificial intelligence
Query strategies for priced information
Journal of Computer and System Sciences - Special issue on STOC 2000
An efficient boosting algorithm for combining preferences
The Journal of Machine Learning Research
Knowledge and Information Systems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A utility theoretic approach to determining optimal wait times in distributed information retrieval
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Flow algorithms for two pipelined filter ordering problems
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The hardness of the Expected Decision Depth problem
Information Processing Letters
Optimization of continuous queries with shared expensive filters
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Scalable event matching for overlapping subscriptions in pub/sub systems
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Efficiency-quality tradeoffs for vector score aggregation
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Foundations and Trends in Databases
A generic flow algorithm for shared filter ordering problems
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithms for distributional and adversarial pipelined filter ordering problems
ACM Transactions on Algorithms (TALG)
Journal of Artificial Intelligence Research
Markov decision processes with multiple long-run average objectives
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Association rule mining: models and algorithms
Association rule mining: models and algorithms
ASIAN'05 Proceedings of the 10th Asian Computing Science conference on Advances in computer science: data management on the web
A fuzzy embedded GA for information retrieving from related data set
MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence
Usercentric Operational Decision Making in Distributed Information Retrieval
Information Systems Research
Markov decision processes with multiple objectives
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Recent advances in multiobjective optimization
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
Parallel pipelined filter ordering with precedence constraints
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
The Internet offers unprecedented access to information. At present most of this information is free, but information providers ore likely to start charging for their services in the near future. With that in mind this paper introduces the following information access problem: given a collection of n information sources, each of which has a known time delay, dollar cost and probability of providing the needed information, find an optimal schedule for querying the information sources. We study several variants of the problem which differ in the definition of an optimal schedule. We first consider a cost model in which the problem is to minimize the expected total cost (monetary and time) of the schedule, subject to the requirement that the schedule may terminate only when the query has been answered or all sources have been queried unsuccessfully. We develop an approximation algorithm for this problem and for an extension of the problem in which more than a single item of information is being sought. We then develop approximation algorithms for a reward model in which a constant reward is earned if the information is successfully provided, and we seek the schedule with the maximum expected difference between the reward and a measure of cost. The monetary and time costs may either appear in the cost measure or be constrained not to exceed a fixed upper bound; these options give rise to four different variants of the reward model.