104 search results - page 6 / 21 » What Is the Optimal Architecture for Visual Information Rout... |
SSDBM
2010
IEEE
14 years 24 days ago
2010
IEEE
Science is becoming data-intensive, requiring new software architectures that can exploit resources at all scales: local GPUs for interactive visualization, server-side multi-core ...
IPSN
2004
Springer
14 years 1 months ago
2004
Springer
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
WICON
2008
13 years 9 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
IV
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Dynamic recompilation tries to produce more efficient code by exploiting runtime information. Virtual machines like the Jikes RVM use recompilation heuristics to decide h...
TON
2008
13 years 7 months ago
2008
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...