5316 search results - page 282 / 1064 » Which Search Problems Are Random |
128
Voted
GCB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. The biomedical literature grows at a tremendous rate, so that finding the relevant literature is becoming more and more difficult. To address this problem we introduce ...
116
Voted
EOR
2006
15 years 5 months ago
2006
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, f...
161
click to vote
EVOW
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we introduce an hybrid evolutionary algorithm for computer-aided orchestration. Our current approach to orchestration consists in replicating a target sound with a se...
146
click to vote
ICVS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
140
click to vote
IC
2003
15 years 6 months ago
2003
The quality of the search experience has been an enduring problem for the World Wide Web. One of the well-known difficulties is the tendency of users to use short, under-specified...