Sciweavers

3841 search results - page 102 / 769
» Crowdsourcing for search evaluation
Sort
View
HPDC
2005
IEEE
16 years 6 hour ago
Dynamic load balancing for distributed search
This paper examines how computation can be mapped across the nodes of a distributed search system to effectively utilize available resources. We specifically address computationa...
Larry Huston, Alex Nizhner, Padmanabhan Pillai, Ra...
SC
2005
ACM
15 years 12 months ago
ClawHMMER: A Streaming HMMer-Search Implementation
The proliferation of biological sequence data has motivated the need for an extremely fast probabilistic sequence search. One method for performing this search involves evaluating...
Daniel Reiter Horn, Mike Houston, Pat Hanrahan
ATAL
2008
Springer
15 years 8 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
TKDE
2008
231views more  TKDE 2008»
15 years 6 months ago
Personalized Concept-Based Clustering of Search Engine Queries
A major problem of current Web search is that search queries are usually short and ambiguous, and thus are insufficient for specifying the precise user needs. To alleviate this pro...
Kenneth Wai-Ting Leung, Wilfred Ng, Dik Lun Lee
AI
2002
Springer
15 years 6 months ago
Parallel Randomized Best-First Minimax Search
We describe a novel parallel randomized search algorithm for two-player games. The algorithm is a randomized version of Korf and Chickering's best-first search. Randomization...
Yaron Shoham, Sivan Toledo