2621 search results - page 28 / 525 » Near orders and codes |
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...
ASPDAC
1999
ACM
14 years 24 days ago
1999
ACM
A method is introduced for model order reduction of large circuits extracted from layout. The algorithm, which is based on balanced realization, can be used for reducing the order ...
IPPS
1998
IEEE
14 years 22 days ago
1998
IEEE
1 The communication cost plays a key role in the performance of many parallel algorithms. In the particular case of the one-sided Jacobi method for symmetric eigenvalue and eigenve...
DFT
2002
IEEE
14 years 1 months ago
2002
IEEE
A novel approach for reducing power consumption in checkers used for concurrent error detection is presented. Spatial correlations between the outputs of the circuit that drives t...
COR
2006
13 years 8 months ago
2006
This paper concerns the search for optimal or nearly optimal batting orders in one-day cricket. A search is conducted over the space of permutations of batting orders where simula...