Sciweavers

805 search results - page 154 / 161
» Modeling the performance of algorithms on flash memory devic...
Sort
View
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 25 days ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
TPDS
2008
196views more  TPDS 2008»
13 years 7 months ago
End-to-End Energy Management in Networked Real-Time Embedded Systems
Recent technological advances have opened up a wide range of distributed real-time applications involving battery-driven embedded devices with local processing and wireless communi...
G. Sudha Anil Kumar, Govindarasu Manimaran, Zhengd...
SPAA
1993
ACM
13 years 11 months ago
Supporting Sets of Arbitrary Connections on iWarp Through Communication Context Switches
In this paper we introduce the ConSet communication model for distributed memory parallel computers. The communication needs of an application program can be satisfied by some ar...
Anja Feldmann, Thomas Stricker, Thomas E. Warfel
SENSYS
2006
ACM
14 years 1 months ago
ATPC: adaptive transmission power control for wireless sensor networks
Extensive empirical studies presented in this paper confirm that the quality of radio communication between low power sensor devices varies significantly with time and environme...
Shan Lin, Jingbin Zhang, Gang Zhou, Lin Gu, John A...
SPAA
2004
ACM
14 years 26 days ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...