8780 search results - page 161 / 1756 » On the Feasibility of Consistent Computations |
202
click to vote
ISQED
2005
IEEE
16 years 20 days ago
2005
IEEE
As the scale and complexity of VLSI circuits increase, Electronic Design Automation (EDA) tools become much more sophisticated and are held to increasing standards of quality. New...
167
click to vote
ISCA
2000
IEEE
15 years 11 months ago
2000
IEEE
Spatial-lattice computations with finite-range interactions are an important class of easily parallelized computations. This class includes many simple and direct algorithms for ...
219
click to vote
CASES
2001
ACM
15 years 10 months ago
2001
ACM
The rapid growth of silicon densities has made it feasible to deploy reconfigurable hardware as a highly parallel computing platform. However, in most cases, the application needs...
184
click to vote
TOMS
2010
15 years 5 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
220
click to vote
GPC
2009
Springer
15 years 4 months ago
2009
Springer
Grid computing involves the ability to harness together the power of computing resources. In this paper we push forward this philosophy and show technologies enabling federation o...