Sciweavers

2808 search results - page 323 / 562
» Routing betweenness centrality
Sort
View
CCGRID
2001
IEEE
15 years 10 months ago
An Adaptive, Reconfigurable Interconnect for Computational Clusters
This paper describes the principles of an original adaptive interconnect for a computational cluster. Torus topology (2d or 3d) is used as a basis but nodes are allowed to effecti...
Alexander V. Shafarenko, Vladimir Vasekin
ICML
2005
IEEE
16 years 7 months ago
Dynamic preferences in multi-criteria reinforcement learning
The current framework of reinforcement learning is based on maximizing the expected returns based on scalar rewards. But in many real world situations, tradeoffs must be made amon...
Sriraam Natarajan, Prasad Tadepalli
VLSID
2004
IEEE
85views VLSI» more  VLSID 2004»
16 years 7 months ago
An Area-Efficient Router for the Data-Intensive Architecture (DIVA) System
A key component of the Data-Intensive Architecture (DIVA) is the Processing-In-Memory (PIM) Routing Component (PiRC) that is responsible for efficient communication between PIM ch...
Sumit D. Mediratta, Jeff Sondeen, Jeffrey T. Drape...
HPCA
2003
IEEE
16 years 7 months ago
Active I/O Switches in System Area Networks
We present an active switch architecture to improve the performance of systems connected via system area networks. Our programmable active switches not only flexibly route packets...
Ming Hao, Mark Heinrich
EWSN
2004
Springer
16 years 6 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig