5316 search results - page 332 / 1064 » Which Search Problems Are Random |
211
click to vote
SIGIR
2010
ACM
15 years 7 months ago
2010
ACM
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
177
click to vote
JCB
1998
15 years 6 months ago
1998
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
194
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
This paper extends an adaptive discretization method, Spliton-Demand (SoD), to be capable of handling multidimensional continuous search spaces. The proposed extension is called m...
172
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
In this paper, we define and study a novel search problem: Comparative Web Search (CWS). The task of CWS is to seek relevant and comparative information from the Web to help users...
196
Voted
ICDCS
1999
IEEE
15 years 11 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...