Sciweavers

14548 search results - page 249 / 2910
» The Optimal Path-Matching Problem
Sort
View
122
Voted
SAC
2002
ACM
15 years 2 months ago
On optimal temporal locality of stencil codes
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
Claudia Leopold
147
Voted
TCAD
1998
159views more  TCAD 1998»
15 years 2 months ago
Code density optimization for embedded DSP processors using data compression techniques
We address the problem of code size minimization in VLSI systems with embedded DSP processors. Reducing code size reduces the production cost of embedded systems. We use data comp...
Stan Y. Liao, Srinivas Devadas, Kurt Keutzer
128
Voted
TVLSI
1998
80views more  TVLSI 1998»
15 years 2 months ago
Power optimization of core-based systems by address bus encoding
— This paper presents a solution to the problem of reducing the power dissipated by a digital system containing an intellectual proprietary core processor which repeatedly execut...
Luca Benini, Giovanni De Micheli, Enrico Macii, Ma...
CNSM
2010
15 years 18 days ago
Near optimal demand-side energy management under real-time demand-response pricing
Abstract--In this paper, we present demand-side energy management under real-time demand-response pricing as a task scheduling problem which is NP-hard. Using minmax as the objecti...
Jin Xiao, Jae Yoon Chung, Jian Li, Raouf Boutaba, ...
138
Voted
OTM
2010
Springer
15 years 14 days ago
Composing Near-Optimal Expert Teams: A Trade-Off between Skills and Connectivity
Abstract. Rapidly changing business requirements necessitate the adhoc composition of expert teams to handle complex business cases. Expertcentric properties such as skills, howeve...
Christoph Dorn, Schahram Dustdar