Sciweavers

2808 search results - page 21 / 562
» Routing betweenness centrality
Sort
View
MOBIHOC
2002
ACM
16 years 4 months ago
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
We present a series of approximation algorithms for finding a small weakly-connected dominating set (WCDS) in a given graph to be used in clustering mobile ad hoc networks. The st...
Yuanzhu Peter Chen, Arthur L. Liestman
EAGC
2003
Springer
15 years 9 months ago
Decentralized vs. Centralized Economic Coordination of Resource Allocation in Grids
Application layer networks are software architectures that allow the provisioning of services requiring a huge amount of resources by connecting large numbers of individual compute...
Torsten Eymann, Michael Reinicke, Oscar Ardaiz, Pa...
271
Voted
TPDS
2008
175views more  TPDS 2008»
15 years 4 months ago
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
Multiple applications that execute concurrently on heterogeneous platforms compete for CPU and network resources. In this paper, we consider the problem of scheduling applications ...
Olivier Beaumont, Larry Carter, Jeanne Ferrante, A...
ACSAC
2004
IEEE
15 years 8 months ago
CTCP: A Transparent Centralized TCP/IP Architecture for Network Security
Many network security problems can be solved in a centralized TCP (CTCP) architecture, in which an organization's edge router transparently proxies every TCP connection betwe...
Fu-Hau Hsu, Tzi-cker Chiueh
AROBOTS
2008
177views more  AROBOTS 2008»
15 years 4 months ago
Controlling swimming and crawling in a fish robot using a central pattern generator
Online trajectory generation for robots with multiple degrees of freedom is still a difficult and unsolved problem, in particular for non-steady state locomotion, that is, when th...
Alessandro Crespi, Daisy Lachat, Ariane Pasquier, ...