Sciweavers

6682 search results - page 137 / 1337
» network 2006
Sort
View
JSA
2000
103views more  JSA 2000»
15 years 5 months ago
O(n) routing in rearrangeable networks
In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree D...
ICDCSW
2006
IEEE
15 years 11 months ago
Service Plans for Context- and QoS-aware Dynamic Middleware
Sten A. Lundesgaard, Ketil Lund, Frank Eliassen
LCN
2006
IEEE
15 years 11 months ago
Ethernet Adaptive Link Rate (ALR): Analysis of a MAC Handshake Protocol
Himanshu Anand, Casey Reardon, Rajagopal Subramani...
SUTC
2006
IEEE
15 years 11 months ago
Configurable NAND Flash Translation Layer
Yi-Lin Tsai, Jen-Wei Hsieh, Tei-Wei Kuo
98
Voted
TRIDENTCOM
2006
IEEE
15 years 11 months ago
Visible light communication using OFDM
Mostafa Z. Afgani, Harald Haas, Hany Elgala, Dietm...