779 search results - page 90 / 156 » Determining Time of Queries for Re-ranking Search Results |
161
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
161
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
188
click to vote
FLAIRS
2004
15 years 7 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
151
click to vote
WWW
2005
ACM
16 years 6 months ago
2005
ACM
The unarguably fast, and continuous, growth of the volume of indexed (and indexable) documents on the Web poses a great challenge for search engines. This is true regarding not on...
162
click to vote
DSS
2007
15 years 6 months ago
2007
In this paper, we report results of an investigation into the factors influencing the selection of sponsored links by e-commerce Web searchers. In this research, 56 participants e...