Sciweavers

2498 search results - page 167 / 500
» Algorithms for the Topological Watershed
Sort
View
NETWORKING
2010
15 years 8 months ago
Efficient Recovery from False State in Distributed Routing Algorithms
Abstract--Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. ...
Daniel Gyllstrom, Sudarshan Vasudevan, Jim Kurose,...
CAD
2007
Springer
15 years 6 months ago
Interpolation by geometric algorithm
We present a novel geometric algorithm to construct a smooth surface that interpolates a triangular or a quadrilateral mesh of arbitrary topological type formed by n vertices. Alt...
Takashi Maekawa, Yasunori Matsumoto, Ken Namiki
TEC
2002
117views more  TEC 2002»
15 years 6 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
INCDM
2010
Springer
172views Data Mining» more  INCDM 2010»
15 years 5 months ago
Evaluating the Quality of Clustering Algorithms Using Cluster Path Lengths
Many real world systems can be modeled as networks or graphs. Clustering algorithms that help us to organize and understand these networks are usually referred to as, graph based c...
Faraz Zaidi, Daniel Archambault, Guy Melanç...
PODC
2009
ACM
16 years 7 months ago
A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
Riko Jacob, Andréa W. Richa, Christian Sche...