Sciweavers

944 search results - page 93 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
INFOSCALE
2007
ACM
14 years 11 months ago
Mining query logs to optimize index partitioning in parallel web search engines
Large-scale Parallel Web Search Engines (WSEs) needs to adopt a strategy for partitioning the inverted index among a set of parallel server nodes. In this paper we are interested ...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...
ESTIMEDIA
2009
Springer
15 years 4 months ago
System-level MP-SoC design space exploration using tree visualization
— The complexity of today’s embedded systems forces designers to model and simulate systems and their components to explore the wide range of design choices. Such design space ...
Toktam Taghavi, Andy D. Pimentel, Mark Thompson
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
SIGIR
2008
ACM
14 years 10 months ago
Optimizing relevance and revenue in ad search: a query substitution approach
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, ...
ECIR
2011
Springer
14 years 1 months ago
Enhancing Deniability against Query-Logs
We propose a method for search privacy on the Internet, focusing on enhancing plausible deniability against search engine query-logs. The method approximates the target search resu...
Avi Arampatzis, Pavlos Efraimidis, George Drosatos