Sciweavers

502 search results - page 60 / 101
» Verifying Balanced Trees
Sort
View
ICC
2007
IEEE
174views Communications» more  ICC 2007»
14 years 4 months ago
Fairness Improvement and Efficient Rerouting in Mobile Ad Hoc Networks
— Mobile ad hoc networking allows nodes to form temporary networks and communicate with each other possibly via multiple hops. By using a special node called the gateway, an ad h...
Norihiro Ohata, Yongbing Zhang, Yusheng Ji, Xuemin...
INFOCOM
2000
IEEE
14 years 2 months ago
REUNITE: A Recursive Unicast Approach to Multicast
—We propose a new multicast protocol called REUNITE. The key idea of REUNITE is to use recursive unicast trees to implement multicast service. REUNITE does not use class D IP add...
Ion Stoica, T. S. Eugene Ng, Hui Zhang
EUROPAR
2008
Springer
13 years 11 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
RAS
2010
117views more  RAS 2010»
13 years 8 months ago
Extending BDI plan selection to incorporate learning from experience
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. We describe a novel BDI exe...
Dhirendra Singh, Sebastian Sardiña, Lin Pad...
SIAMSC
2011
140views more  SIAMSC 2011»
13 years 22 days ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...