Sciweavers

3715 search results - page 472 / 743
» A Space Optimization for FP-Growth
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Fast Analytic Placement using Minimum Cost Flow
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
Ameya R. Agnihotri, Patrick H. Madden
DATE
2009
IEEE
107views Hardware» more  DATE 2009»
15 years 10 months ago
Sequential logic rectifications with approximate SPFDs
In the digital VLSI cycle, logic transformations are often required to modify the design to meet different synthesis and optimization goals. Logic transformations on sequential ci...
Yu-Shen Yang, Subarna Sinha, Andreas G. Veneris, R...
GECON
2007
Springer
153views Business» more  GECON 2007»
15 years 10 months ago
Managing a Peer-to-Peer Backup System: Does Imposed Fairness Socially Outperform a Revenue-Driven Monopoly?
We study a peer-to-peer backup system, where users offer some of their storage space to provide service for the others. The economic model for such a system is different from the o...
László Toka, Patrick Maillé
ICAS
2009
IEEE
126views Robotics» more  ICAS 2009»
15 years 10 months ago
Heterogeneous QoS Resource Manager with Prediction
As long as computers continue to get more CPU processing power, data centers need to optimize their power usage. We can do this and maintain the same complexity level as before by...
Ramon Nou, Jordi Torres
AI
2006
Springer
15 years 10 months ago
Exploiting Dynamic Independence in a Static Conditioning Graph
Abstract. A conditioning graph (CG) is a graphical structure that attempt to minimize the implementation overhead of computing probabilities in belief networks. A conditioning grap...
Kevin Grant, Michael C. Horsch