Sciweavers

1077 search results - page 191 / 216
» Approximate reduction of dynamic systems
Sort
View
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
13 years 11 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
DBVIS
1993
101views Database» more  DBVIS 1993»
13 years 11 months ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
ICC
2000
IEEE
241views Communications» more  ICC 2000»
13 years 11 months ago
Power Management for Throughput Enhancement in Wireless Ad-Hoc Networks
—In this paper we introduce the notion of power management within the context of wireless ad-hoc networks. More specifically, we investigate the effects of using different trans...
Tamer A. ElBatt, Srikanth V. Krishnamurthy, Dennis...
DAC
2005
ACM
14 years 8 months ago
User-perceived latency driven voltage scaling for interactive applications
Power has become a critical concern for battery-driven computing systems, on which many applications that are run are interactive. System-level voltage scaling techniques, such as...
Le Yan, Lin Zhong, Niraj K. Jha
CASES
2006
ACM
14 years 1 months ago
Adaptive object code compression
Previous object code compression schemes have employed static and semiadaptive compression algorithms to reduce the size of instruction memory in embedded systems. The suggestion ...
John Gilbert, David M. Abrahamson