5316 search results - page 294 / 1064 » Which Search Problems Are Random |
165
click to vote
EDBT
2009
ACM
16 years 25 days ago
2009
ACM
Keyword search has been recently extended to relational databases to retrieve information from text-rich attributes. However, all the existing methods focus on finding individual...
164
click to vote
CBMS
2005
IEEE
15 years 8 months ago
2005
IEEE
In gene expression data a bicluster is a subset of genes and a subset of conditions which show correlating levels of expression. However, the problem of finding significant biclu...
143
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
157
click to vote
ACNS
2005
Springer
15 years 11 months ago
2005
Springer
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
168
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...