Sciweavers

596 search results - page 55 / 120
» Evaluating web search using task completion time
Sort
View
109
Voted
ICRA
2008
IEEE
136views Robotics» more  ICRA 2008»
15 years 10 months ago
Multi-agent probabilistic search in a sequential decision-theoretic framework
— Consider the task of searching a region for the presence or absence of a target using a team of multiple searchers. This paper formulates this search problem as a sequential pr...
Timothy H. Chung, Joel W. Burdick
129
Voted
AAAI
2004
15 years 5 months ago
Leap Before You Look: An Effective Strategy in an Oversubscribed Scheduling Problem
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
Laura Barbulescu, L. Darrell Whitley, Adele E. How...
145
Voted
CICLING
2005
Springer
15 years 9 months ago
Two Web-Based Approaches for Noun Sense Disambiguation
The problem of the resolution of the lexical ambiguity, which is commonly referred as Word Sense Disambiguation (WSD), seems to be stuck because of the knowledge acquisition bottle...
Paolo Rosso, Manuel Montes-y-Gómez, Davide ...
159
Voted
SIGDIAL
2010
15 years 1 months ago
Adaptive Referring Expression Generation in Spoken Dialogue Systems: Evaluation with Real Users
We present new results from a real-user evaluation of a data-driven approach to learning user-adaptive referring expression generation (REG) policies for spoken dialogue systems. ...
Srinivasan Janarthanam, Oliver Lemon
139
Voted
ICTIR
2009
Springer
15 years 1 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette