Sciweavers

229 search results - page 12 / 46
» Search performance analysis and robust search algorithm in u...
Sort
View
CLUSTER
2005
IEEE
14 years 1 months ago
Efficient and Robust Computation of Resource Clusters in the Internet
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
Chuang Liu, Ian T. Foster
NOMS
2008
IEEE
139views Communications» more  NOMS 2008»
14 years 2 months ago
Fast similarity search in peer-to-peer networks
Abstract—Peer-to-peer (P2P) systems show numerous advantages over centralized systems, such as load balancing, scalability, and fault tolerance, and they require certain function...
Thomas Bocek, Ela Hunt, David Hausheer, Burkhard S...
MM
2004
ACM
101views Multimedia» more  MM 2004»
14 years 1 months ago
Searching notated polyphonic music using transportation distances
We present a method for searching databases of symbolically represented polyphonic music that exploits advantages of transportation distances such as continuity and partial matchi...
Rainer Typke, Remco C. Veltkamp, Frans Wiering
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 8 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
ARCS
2004
Springer
14 years 1 months ago
Latent Semantic Indexing in Peer-to-Peer Networks
Searching in decentralized peer-to-peer networks is a challenging problem. In common applications such as Gnutella, searching is performed by randomly forwarding queries to all pee...
Xuezheng Liu, Ming Chen, Guangwen Yang