4377 search results - page 234 / 876 » Mass problems and randomness |
171
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
190
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
197
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
166
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
This paper investigates randomization and replication as strategies to achieve reliable performance in disk arrays targeted for video-on-demand (VoD) workloads. A disk array can p...
211
click to vote
SIAMREV
2010
15 years 1 months ago
2010
In this paper we propose and analyze a Stochastic-Collocation method to solve elliptic Partial Differential Equations with random coefficients and forcing terms (input data of the...