Sciweavers

1278 search results - page 113 / 256
» Design and Analysis of Parametric Query Optimization Algorit...
Sort
View
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
14 years 11 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
DAC
2005
ACM
14 years 11 months ago
Power grid simulation via efficient sampling-based sensitivity analysis and hierarchical symbolic relaxation
On-chip supply networks are playing an increasingly important role for modern nanometer-scale designs. However, the ever growing sizes of power grids make the analysis problem ext...
Peng Li
DAC
2004
ACM
15 years 10 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
APN
2005
Springer
15 years 3 months ago
Continuization of Timed Petri Nets: From Performance Evaluation to Observation and Control
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
Manuel Silva, Laura Recalde
CASES
2003
ACM
15 years 3 months ago
Polynomial-time algorithm for on-chip scratchpad memory partitioning
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...
Federico Angiolini, Luca Benini, Alberto Caprara