Does partial difficult search help difficult search?

Interactive Search Support for Difficult Web Queries

Short and common web queries are aptly supported by stateof-the-art search engines but performance and user experience are degraded when web queries are longer and less common. Extending previous solutions that automatically shorten queries, we introduce searchAssist: a novel search interface that provides interactive support for difficult web queries. The query logs and questionnaires from a n...

A difficult step in meta-analysis: refining the search.

Evolving difficult SAT instances thanks to local search

We propose to use local search algorithms to produce sat instances which are harder to solve than randomly generated k-cnf formulae. The first results, obtained with rudimentary search algorithms, show that the approach deserves further study. It could be used as a test of robustness for sat solvers, and could help to investigate how branching heuristics, learning strategies, and other aspects ...

FindZebra - the search engine for difficult medical cases

Physicians as well as laypeople use both general purpose and specialised web-based search tools when confronted with medical questions. FindZebra.com is a tool for generating hypotheses about rare disease diagnosis. It uses freely available high quality curated information on rare diseases and open source information retrieval software (Apache Lucene Solr) tailored to the problem. FindZebra is ...

Information-limited parallel processing in difficult heterogeneous covert visual search.

Difficult visual search is often attributed to time-limited serial attention operations, although neural computations in the early visual system are parallel. Using probabilistic search models (Dosher, Han, & Lu, 2004) and a full time-course analysis of the dynamics of covert visual search, we distinguish unlimited capacity parallel versus serial search mechanisms. Performance is measured for d...