Sciweavers

860 search results - page 67 / 172
» Biased Random Walks
Sort
View
WWW
2010
ACM
15 years 7 months ago
Optimal rare query suggestion with implicit user feedback
Query suggestion has been an effective approach to help users narrow down to the information they need. However, most of existing studies focused on only popular/head queries. Si...
Yang Song, Li-wei He
97
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
Budget-Based Self-Optimized Incentive Search in Unstructured P2P Networks
—Distributed object search is the primary function of Peer-to-Peer (P2P) file sharing system to locate and transfer the file. The predominant search schemes in unstructured P2P...
Yi Hu, Min Feng, Laxmi N. Bhuyan, Vana Kalogeraki
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 2 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
85
Voted
BMCBI
2007
123views more  BMCBI 2007»
15 years 24 days ago
Tracembler - software for in-silico chromosome walking in unassembled genomes
Background: Whole genome shotgun sequencing produces increasingly higher coverage of a genome with random sequence reads. Progressive whole genome assembly and eventual finishing ...
Qunfeng Dong, Matthew D. Wilkerson, Volker Brendel
95
Voted
GECCO
2006
Springer
195views Optimization» more  GECCO 2006»
15 years 4 months ago
Studying XCS/BOA learning in Boolean functions: structure encoding and random Boolean functions
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
Martin V. Butz, Martin Pelikan