Sciweavers

108 search results - page 20 / 22
» A Lower Bound for Dynamic Scheduling of Data Parallel Progra...
Sort
View
ICPADS
2010
IEEE
13 years 5 months ago
M-cube: A Duty Cycle Based Multi-channel MAC Protocol with Multiple Channel Reservation for WSNs
In this paper, a duty cycle based multi-channel MAC protocol with multiple channel reservation, called M-cube, is proposed to tackle the triple hidden terminal problems. M-cube can...
Jinbao Li, Desheng Zhang, Longjiang Guo, Shouling ...
CASES
2007
ACM
13 years 11 months ago
Recursive function data allocation to scratch-pad memory
This paper presents the first automatic scheme to allocate local (stack) data in recursive functions to scratch-pad memory (SPM) in embedded systems. A scratch-pad is a fast direct...
Angel Dominguez, Nghi Nguyen, Rajeev Barua
INFOCOM
2008
IEEE
14 years 1 months ago
A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks
Cognitive radio (CR) is a revolution in radio technology and is viewed as an enabling technology for dynamic spectrum access. This paper investigates how to design distributed alg...
Yi Shi, Y. Thomas Hou
SP
2002
IEEE
109views Security Privacy» more  SP 2002»
13 years 7 months ago
Scalable atomistic simulation algorithms for materials research
A suite of scalable atomistic simulation programs has been developed for materials research based on space-time multiresolution algorithms. Design and analysis of parallel algorit...
Aiichiro Nakano, Rajiv K. Kalia, Priya Vashishta, ...
LICS
1997
IEEE
13 years 11 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...