Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Do the right thing: studies in limited rationality
Do the right thing: studies in limited rationality
Computation and action under bounded resources
Computation and action under bounded resources
Deliberation scheduling for problem solving in time-constrained environments
Artificial Intelligence
A system for discovering relationships by feature extraction from text databases
SIGIR '94 Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval
Learning to act using real-time dynamic programming
Artificial Intelligence - Special volume on computational research on interaction and agency, part 1
TREC and TIPSTER experiments with INQUERY
TREC-2 Proceedings of the second conference on Text retrieval conference
Journal of the American Society for Information Science
Relevance feedback with too much data
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Planning under time constraints in stochastic domains
Artificial Intelligence - Special volume on planning and scheduling
Optimal composition of real-time systems
Artificial Intelligence
Query expansion using local and global document analysis
SIGIR '96 Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval
On relevance weights with little relevance information
Proceedings of the 20th annual international ACM SIGIR conference on Research and development in information retrieval
Solving the word mismatch problem through automatic text analysis
Solving the word mismatch problem through automatic text analysis
Translingual information retrieval: learning from bilingual corpora
Artificial Intelligence - Special issue: artificial intelligence 40 years later
Document expansion for speech retrieval
Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Local Feedback in Full-Text Retrieval Systems
Journal of the ACM (JACM)
Improving the effectiveness of information retrieval with local context analysis
ACM Transactions on Information Systems (TOIS)
Evaluating evaluation measure stability
SIGIR '00 Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval
Using part-of-speech patterns to reduce query ambiguity
SIGIR '02 Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval
Adaptive information retrieval: machine learning in associative networks (connectionist, free-text, browsing, feedback)
Interactive information organization: techniques and evaluation
Interactive information organization: techniques and evaluation
Handling duration uncertainty in meta-level control of progressive processing
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Monitoring the progress of anytime problem-solving
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Models of continual computation
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Learning policies for sequential time and cost sensitive classification
UBDM '05 Proceedings of the 1st international workshop on Utility-based data mining
Resource-adaptive real-time new event detection
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Learning parallel portfolios of algorithms
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
This paper presents a new approach to information retrieval (IR) based on run-time selection of the best set of techniques to respond to a given query. A technique is selected based on its projected effectiveness with respect to the specific query, the load on the system, and a time-dependent utility function. The paper examines two fundamental questions: (1) can the selection of the best IR techniques be performed at run-time with minimal computational overhead? and (2) is it possible to construct a reliable probabilistic model of the performance of an IR technique that is conditioned on the characteristics of the query? We show that both of these questions can be answered positively. These results suggest a new system design that carries a great potential to improve the quality of service of future IR systems.