Sciweavers

254 search results - page 24 / 51
» Semi-autonomous networks: Network resilience and adaptive tr...
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Self-optimizing distributed trees
We present a novel protocol for restructuring a treebased overlay network in response to the workload of the application running over it. Through low-cost restructuring operations...
Michael K. Reiter, Asad Samar, Chenxi Wang
ESWA
2008
119views more  ESWA 2008»
13 years 7 months ago
Incremental clustering of mixed data based on distance hierarchy
Clustering is an important function in data mining. Its typical application includes the analysis of consumer's materials. Adaptive resonance theory network (ART) is very pop...
Chung-Chian Hsu, Yan-Ping Huang
ICCAD
2000
IEEE
138views Hardware» more  ICCAD 2000»
14 years 2 days ago
Fast Analysis and Optimization of Power/Ground Networks
This paper presents an efficient method for optimizing power/ground (P/G) networks by widening wires and adding decoupling capacitors (decaps). It proposes a structured skeleton t...
Haihua Su, Kaushik Gala, Sachin S. Sapatnekar
EUROCAST
2009
Springer
185views Hardware» more  EUROCAST 2009»
14 years 2 months ago
Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
Martin Gruber, Günther R. Raidl
MOBIHOC
2007
ACM
14 years 7 months ago
A random perturbation-based scheme for pairwise key establishment in sensor networks
A prerequisite for secure communications between two sensor nodes is that these nodes exclusively share a pairwise key. Although numerous pairwise key establishment (PKE) schemes ...
Wensheng Zhang, Minh Tran, Sencun Zhu, Guohong Cao