Sciweavers

1550 search results - page 13 / 310
» Optimizing search by showing results in context
Sort
View
KR
2004
Springer
15 years 5 months ago
Breadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
Rong Zhou, Eric A. Hansen
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
15 years 5 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
77
Voted
ITCC
2002
IEEE
15 years 4 months ago
Taxonomy-based Adaptive Web Search Method
Current crawler-based search engines usually return a long list of search results containing a lot of noise documents. By indexing collected documents on topic path in taxonomy, t...
Said Mirza Pahlevi, Hiroyuki Kitagawa
BMCBI
2007
143views more  BMCBI 2007»
14 years 11 months ago
An adaptive bin framework search method for a beta-sheet protein homopolymer model
Background: The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This probl...
Alena Shmygelska, Holger H. Hoos
WWW
2010
ACM
15 years 6 months ago
Beyond position bias: examining result attractiveness as a source of presentation bias in clickthrough data
Leveraging clickthrough data has become a popular approach for evaluating and optimizing information retrieval systems. Although data is plentiful, one must take care when interpr...
Yisong Yue, Rajan Patel, Hein Roehrig