1662 search results - page 301 / 333 » The Computational Complexity of Agent Design Problems |
ICCAD
1995
IEEE
14 years 6 days ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
ICFEM
2009
Springer
13 years 6 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
PLDI
2012
ACM
11 years 11 months ago
2012
ACM
While graphics processing units (GPUs) provide low-cost and efficient platforms for accelerating high performance computations, the tedious process of performance tuning required...
CACM
2002
13 years 8 months ago
2002
Abstract. We have developed a digital city for Kyoto, the old capital and cultural center of Japan, as a social information infrastructure for urban everyday life including shoppin...
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
14 years 2 months ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...