Sciweavers

332 search results - page 30 / 67
» Hypercubic Sorting Networks
Sort
View
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
14 years 11 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
DC
2010
14 years 9 months ago
Towards worst-case churn resistant peer-to-peer systems
Abstract Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as w...
Fabian Kuhn, Stefan Schmid, Roger Wattenhofer
75
Voted
CEC
2007
IEEE
15 years 3 months ago
NEMO: neural enhancement for multiobjective optimization
— In this paper, a neural network approach is presented to expand the Pareto-optimal front for multiobjective optimization problems. The network is trained using results obtained...
Aaron Garrett, Gerry V. Dozier, Kalyanmoy Deb
IPPS
1997
IEEE
15 years 1 months ago
Cyclic Networks: A Family of Versatile Fixed-Degree Interconnection Architectures
In this paper, we propose a new family of interconnection networks, called cyclic networks (CNs), in which an intercluster connection is defined on a set of nodes whose addresses...
Chi-Hsiang Yeh, Behrooz Parhami
AINA
2007
IEEE
15 years 3 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein