Sciweavers

348 search results - page 62 / 70
» Stability and Performances in Biclustering Algorithms
Sort
View
SPAA
2004
ACM
14 years 27 days ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
TPDS
2010
176views more  TPDS 2010»
13 years 5 months ago
Coupling-Based Internal Clock Synchronization for Large-Scale Dynamic Distributed Systems
This paper studies the problem of realizing a common software clock among a large set of nodes without an external time reference (i.e., internal clock synchronization), any centr...
Roberto Baldoni, Angelo Corsaro, Leonardo Querzoni...
ATAL
2006
Springer
13 years 11 months ago
Efficient agents for cliff-edge environments with a large set of decision options
This paper proposes an efficient agent for competing in Cliff Edge (CE) environments, such as sealed-bid auctions, dynamic pricing and the ultimatum game. The agent competes in on...
Ron Katz, Sarit Kraus
CN
2006
84views more  CN 2006»
13 years 7 months ago
Dynamic overlay routing based on available bandwidth estimation: A simulation study
Dynamic overlay routing has been proposed as a way to enhance the reliability and performance of IP networks. The major premise is that overlay routing can bypass congestion, tran...
Yong Zhu, Constantinos Dovrolis, Mostafa H. Ammar
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
Coalition Formation Games for Collaborative Spectrum Sensing
Abstract--Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the d...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...