5316 search results - page 315 / 1064 » Which Search Problems Are Random |
160
Voted
WWW
2007
ACM
16 years 7 months ago
2007
ACM
This paper addresses the desktop search problem by considering various techniques for ranking results of a search query over the file system. First, basic ranking techniques, whic...
151
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
161
click to vote
GECCO
1999
Springer
15 years 11 months ago
1999
Springer
Crossover operators that preserve common components can also preserve representation level constraints. Consequently, these constraints can be used to beneficially reduce the sea...
169
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
135
click to vote
BIS
2007
15 years 8 months ago
2007
In this paper we introduce a prototype job portal which uses semantically annotated job offers and applicants. In our opinion, using Semantic Web technologies substantially increa...