Sciweavers

4198 search results - page 58 / 840
» In search of lost time
Sort
View
SAC
2005
ACM
15 years 11 months ago
Limited assignments: a new cutoff strategy for incomplete depth-first search
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
Roman Barták, Hana Rudová
HCI
2009
15 years 3 months ago
An Analysis of Eye Movements during Browsing Multiple Search Results Pages
In general, most search engines display a certain number of search results on a search results page at one time, separating the entire search results into multiple search results p...
Yuko Matsuda, Hidetake Uwano, Masao Ohira, Ken-ich...
ISCIS
2005
Springer
15 years 11 months ago
An Investigation of the Course-Section Assignment Problem
Abstract. We investigate the problem of enumerating schedules, consisting of course-section assignments, in increasing order of the number of conflicts they contain. We define th...
Zeki Bayram
TREC
2007
15 years 7 months ago
Dartmouth College at TREC 2007 Legal Track
This report describes Dartmouth College’s approach and results for the 2007 TREC Legal Track. Our original plan was to use the Combination of Expert Opinion (CEO) algorithm [1],...
Wei-Ming Chen, Paul Thompson
JCIT
2010
182views more  JCIT 2010»
15 years 19 days ago
CT-Rank: A Time-aware Ranking Algorithm for Web Search
Time plays important roles in Web search, because most Web pages contain time information and a lot of Web queries are time-related. However, traditional search engines such as Go...
Peiquan Jin, Xiaowen Li, Hong Chen, Lihua Yue