5316 search results - page 189 / 1064 » Which Search Problems Are Random |
122
click to vote
ICDCSW
2005
IEEE
15 years 9 months ago
2005
IEEE
Existing cluster-based searching schemes in unstructured peer-to-peer (P2P) networks employ flooding/random forwarding on connected dominating sets (CDS) of networks. There exist...
138
click to vote
PVLDB
2008
15 years 3 months ago
2008
Many search engines and other web applications suggest auto-completions as the user types in a query. The suggestions are generated from hidden underlying databases, such as query...
109
click to vote
ICASSP
2011
IEEE
14 years 7 months ago
2011
IEEE
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
182
click to vote
STACS
2012
Springer
13 years 11 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
102
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The deterministic Multi-step Crossover Fusion (dMSXF) is an improved crossover method of MSXF which is a promising method of JSP, and it shows high availability in TSP. Both of th...