Sciweavers

842 search results - page 129 / 169
» Distributed Innovation in Classes of Networks
Sort
View
CCR
2006
122views more  CCR 2006»
13 years 9 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
ANCS
2009
ACM
13 years 7 months ago
Weighted random oblivious routing on torus networks
Torus, mesh, and flattened butterfly networks have all been considered as candidate architectures for on-chip interconnection networks. In this paper, we study the problem of opti...
Rohit Sunkam Ramanujam, Bill Lin
USENIX
2008
13 years 11 months ago
Large-scale Virtualization in the Emulab Network Testbed
Network emulation is valuable largely because of its ability to study applications running on real hosts and "somewhat real" networks. However, conservatively allocating...
Mike Hibler, Robert Ricci, Leigh Stoller, Jonathon...
ADHOC
2007
169views more  ADHOC 2007»
13 years 9 months ago
Ensuring strong data guarantees in highly mobile ad hoc networks via quorum systems
Ensuring the consistency and the availability of replicated data in highly mobile ad hoc networks is a challenging task because of the lack of a backbone infrastructure. Previous ...
Daniela Tulone
ICML
2007
IEEE
14 years 10 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...