Sciweavers

3897 search results - page 455 / 780
» complexity 2010
Sort
View
CASES
2010
ACM
15 years 4 months ago
Resource recycling: putting idle resources to work on a composable accelerator
Mobile computing platforms in the form of smart phones, netbooks, and personal digital assistants have become an integral part of our everyday lives. Moving ahead to the future, m...
Yongjun Park, Hyunchul Park, Scott A. Mahlke, Sukj...
COCOA
2010
Springer
15 years 4 months ago
Time Optimal Algorithms for Black Hole Search in Rings
In a network environments supporting mobile entities (called robots or agents), a black hole is harmful site that destroys any incoming entity without leaving any visible trace. Th...
Balasingham Balamohan, Paola Flocchini, Ali Miri, ...
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 4 months ago
Computing (or not) Quasi-Periodicity Functions of Tilings
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...
Alexis Ballier, Emmanuel Jeandel
GLOBECOM
2010
IEEE
15 years 4 months ago
On Comparing the Performance of Dynamic Multi-Network Optimizations
With a large variety of wireless access technologies available, multi-homed devices may strongly improve the performance and reliability of communication when using multiple networ...
Geert Jan Hoekstra, Robert D. van der Mei, J. W. B...
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 1 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...