Sciweavers

11371 search results - page 319 / 2275
» The network inhibition problem
Sort
View
APNOMS
2009
Springer
15 years 4 months ago
Network Partitioning and Self-sizing Methods for QoS Management with Autonomic Characteristics
The inherent and increasing complexity, heterogeneity and unpredictability of computer networks make the task of managing these systems highly complex. The autonomic computing para...
Romildo Martins da Silva Bezerra, Joberto Sé...
PADL
2009
Springer
16 years 7 months ago
Operational Semantics for Declarative Networking
Declarative Networking has been recently promoted as a high-level programming paradigm to more conveniently describe and implement systems that run in a distributed fashion over a ...
Juan A. Navarro, Andrey Rybalchenko
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 7 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
MOBIHOC
2003
ACM
16 years 6 months ago
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
In hostile environments, the enemy can launch traffic analysis against interceptable routing information embedded in routing messages and data packets. Allowing adversaries to tra...
Jiejun Kong, Xiaoyan Hong
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
16 years 1 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu