Sciweavers

566 search results - page 101 / 114
» Solution Reuse in Dynamic Constraint Satisfaction Problems
Sort
View
95
Voted
DAC
2009
ACM
16 years 1 months ago
Contract-based system-level composition of analog circuits
Efficient system-level design is increasingly relying on hierarchical design-space exploration, as well as compositional methods, to shorten time-to-market, leverage design re-use...
Xuening Sun, Pierluigi Nuzzo, Chang-Ching Wu, Albe...
DAC
2007
ACM
16 years 1 months ago
Gate Sizing For Cell Library-Based Designs
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
Shiyan Hu, Mahesh Ketkar, Jiang Hu
WWW
2007
ACM
16 years 1 months ago
A scalable application placement controller for enterprise data centers
Given a set of machines and a set of Web applications with dynamically changing demands, an online application placement controller decides how many instances to run for each appl...
Chunqiang Tang, Malgorzata Steinder, Mike Spreitze...
162
Voted
ICDE
2011
IEEE
237views Database» more  ICDE 2011»
14 years 4 months ago
Creating probabilistic databases from imprecise time-series data
— Although efficient processing of probabilistic databases is a well-established field, a wide range of applications are still unable to benefit from these techniques due to t...
Saket Sathe, Hoyoung Jeung, Karl Aberer
ISLPED
2000
ACM
77views Hardware» more  ISLPED 2000»
15 years 4 months ago
A recursive algorithm for low-power memory partitioning
Memory-processor integration o ers new opportunities for reducing the energy of a system. In the case of embedded systems, one solution consists of mapping the most frequently acc...
Luca Benini, Alberto Macii, Massimo Poncino