Sciweavers

3206 search results - page 471 / 642
» Optimizing Graph Algorithms for Improved Cache Performance
Sort
View
MOBICOM
2003
ACM
14 years 2 months ago
Minimum energy disjoint path routing in wireless ad-hoc networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
Anand Srinivas, Eytan Modiano
CC
2011
Springer
270views System Software» more  CC 2011»
13 years 25 days ago
Subregion Analysis and Bounds Check Elimination for High Level Arrays
For decades, the design and implementation of arrays in programming languages has reflected a natural tension between productivity and performance. Recently introduced HPCS langua...
Mackale Joyner, Zoran Budimlic, Vivek Sarkar
SIGMETRICS
2002
ACM
118views Hardware» more  SIGMETRICS 2002»
13 years 9 months ago
Robust traffic engineering: game theoretic perspective
On-line routing algorithms deal with requests as they arrive without assuming any knowledge of the underlying process that generates the streams of requests. By contrast, off-line...
Vladimir Marbukh
TNN
2010
176views Management» more  TNN 2010»
13 years 4 months ago
On the weight convergence of Elman networks
Abstract--An Elman network (EN) can be viewed as a feedforward (FF) neural network with an additional set of inputs from the context layer (feedback from the hidden layer). Therefo...
Qing Song
CCGRID
2011
IEEE
13 years 25 days ago
Small Discrete Fourier Transforms on GPUs
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...
S. Mitra, A. Srinivasan