3941 search results - page 186 / 789 » Computational Efficiency of Batching Methods |
133
click to vote
ICCAD
1999
IEEE
15 years 8 months ago
1999
IEEE
This paper proposes lazy group sifting for dynamic variable reordering during state traversal. The proposed method relaxes the idea of pairwise grouping of present state variables...
121
click to vote
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
We study the problem of exploiting parallelism from search-based AI systems on distributed machines. We propose stack-splitting, a technique for implementing orparallelism, which ...
120
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
112
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We present a method to compute, quickly and efficiently, the mutual information achieved by an IID (independent identically distributed) complex Gaussian input on a block Rayleigh-...
167
click to vote
NIPS
2004
15 years 5 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...