Sciweavers

3737 search results - page 547 / 748
» Parallel Distributed Belief Networks
Sort
View
CLUSTER
2004
IEEE
15 years 7 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
GLOBECOM
2006
IEEE
15 years 10 months ago
Optimal Routing Between Alternate Paths With Different Network Transit Delays
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
Essia Hamouda Elhafsi, Mart Molle
ICDCSW
2005
IEEE
15 years 9 months ago
Cluster-Based Intelligent Searching in Unstructured Peer-to-Peer Networks
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...
Xiuqi Li, Jie Wu
ISMIR
2004
Springer
145views Music» more  ISMIR 2004»
15 years 9 months ago
Audio Fingerprinting In Peer-to-peer Networks
Despite the immense potential of Peer-to-Peer (P2P) networks in facilitating collaborative applications, they have become largely known as a free haven for pirated music swapping....
Prarthana Shrestha, Ton Kalker
GCC
2003
Springer
15 years 9 months ago
Dominating-Set-Based Searching in Peer-to-Peer Networks
— The peer-to-peer network for sharing information and data through direct exchange has emerged rapidly in recent years. The searching problem is a basic issue that addresses the...
Chunlin Yang, Jie Wu