Sciweavers

681 search results - page 7 / 137
» Searching with expectations
Sort
View
TCS
2008
14 years 11 months ago
The cost of offline binary search tree algorithms and the complexity of the request sequence
In evaluating the performance of online algorithms for search trees, one wants to compare them to the best offline algorithm available. In this paper we lower bound the cost of an...
Jussi Kujala, Tapio Elomaa
ICALP
2003
Springer
15 years 4 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper
ICWS
2004
IEEE
15 years 1 months ago
Context Disambiguation in Web Search Results
We commonly come across pages that are not of interest while searching the web. This is partly due to a word or words in the search query having different contexts, the user obvio...
P. Deepak, Jyothi John, Sandeep Parameswaran
AAMAS
2010
Springer
14 years 11 months ago
Multi-goal economic search using dynamic search structures
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
David Sarne, Efrat Manisterski, Sarit Kraus
ECIR
2010
Springer
14 years 12 months ago
Learning to Distribute Queries into Web Search Nodes
Web search engines are composed of a large set of search nodes and a broker machine that feeds them with queries. A location cache keeps minimal information in the broker to regist...
Marcelo Mendoza, Mauricio Marín, Flavio Fer...