Sciweavers

1612 search results - page 43 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
PTS
2010
134views Hardware» more  PTS 2010»
14 years 8 months ago
A Learning-Based Approach to Unit Testing of Numerical Software
We present an application of learning-based testing to the problem of automated test case generation (ATCG) for numerical software. Our approach uses n-dimensional polynomial model...
Karl Meinke, Fei Niu
JMLR
2010
92views more  JMLR 2010»
14 years 4 months ago
Posterior distributions are computable from predictive distributions
As we devise more complicated prior distributions, will inference algorithms keep up? We highlight a negative result in computable probability theory by Ackerman, Freer, and Roy (...
Cameron E. Freer, Daniel M. Roy
GLOBECOM
2007
IEEE
15 years 4 months ago
Opportunistic Access with Random Subchannel Backoff (OARSB) for OFDMA Uplink
Abstract— A distributed medium access control (MAC) algorithm for uplink OFDMA networks under the IEEE 802.16 framework is proposed and analyzed in this work. We present a simple...
Yu-Jung Chang, Feng-Tsun Chien, C. C. Jay Kuo
IPPS
1998
IEEE
15 years 2 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
ECAI
2004
Springer
15 years 3 months ago
Generating Random Bayesian Networks with Constraints on Induced Width
We present algorithms for the generation of uniformly distributed Bayesian networks with constraints on induced width. The algorithms use ergodic Markov chains to generate samples....
Jaime Shinsuke Ide, Fabio Gagliardi Cozman, Fabio ...