Sciweavers

945 search results - page 95 / 189
» On Equivalence Between Network Topologies
Sort
View
GC
2004
Springer
14 years 2 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
NETWORKS
2006
13 years 9 months ago
Extreme point characterizations for infinite network flow problems
We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...
H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith
ICFCA
2007
Springer
14 years 25 days ago
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets
Different rule semantics have been successively defined in many contexts such as implications in artificial intelligence, functional dependencies in databases or association rules...
Marie Agier, Jean-Marc Petit
SIMUTOOLS
2008
13 years 10 months ago
A simulation model of DYMO for ad hoc routing in OMNeT++
Mobile Ad Hoc Networks (MANETs) have evolved in the last years into standards in the communication world. By definition, they do not need any network infrastructure to facilitate ...
Christoph Sommer, Isabel Dietrich, Falko Dressler
INFORMATICALT
2011
170views more  INFORMATICALT 2011»
13 years 4 months ago
Community Detection Through Optimal Density Contrast of Adjacency Matrix
Detecting communities in real world networks is an important problem for data analysis in science and engineering. By clustering nodes intelligently, a recursive algorithm is desig...
Tianzhu Liang, Kwok Yip Szeto