Sciweavers

1569 search results - page 199 / 314
» Automated Design Improvement by Example
Sort
View
CCR
2006
117views more  CCR 2006»
15 years 4 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
123
Voted
JAR
2006
87views more  JAR 2006»
15 years 3 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
SCL
2008
95views more  SCL 2008»
15 years 3 months ago
Performance bounds in linear control of unstable MIMO systems with pole location constraint
This paper proposes a methodology to compute quadratic performance bounds when the closed loop poles of a discrete-time multivariable control loop are confined to a disk, centred ...
Andrés A. Peters, Mario E. Salgado, Eduardo...
TPDS
2002
136views more  TPDS 2002»
15 years 3 months ago
Automatic Partitioning of Parallel Loops with Parallelepiped-Shaped Tiles
In this paper, an efficient algorithm to implement loop partitioning is introduced and evaluated. We start from results of Agarwal et al. [1] whose aim is to minimize the number of...
Fabrice Rastello, Yves Robert
SAC
2008
ACM
15 years 3 months ago
Filtering drowsy instruction cache to achieve better efficiency
Leakage power in cache memories represents a sizable fraction of total power consumption, and many techniques have been proposed to reduce it. As a matter of fact, during a fixed ...
Roberto Giorgi, Paolo Bennati