Sciweavers

653 search results - page 3 / 131
» Using common random numbers for indifference-zone selection
Sort
View
CSB
2003
IEEE
14 years 25 days ago
Fast and Sensitive Probe Selection for DNA Chips Using Jumps in Matching Statistics
The design of large scale DNA microarrays is a challenging problem. So far, probe selection algorithms must trade the ability to cope with large scale problems for a loss of accur...
Sven Rahmann
ICPP
2008
IEEE
14 years 2 months ago
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis
Numerical simulations in computational physics, biology, and finance, often require the use of high quality and efficient parallel random number generators. We design and optimi...
David A. Bader, Aparna Chandramowlishwaran, Virat ...
FPT
2005
IEEE
170views Hardware» more  FPT 2005»
14 years 1 months ago
High Quality Uniform Random Number Generation Through LUT Optimised Linear Recurrences
This paper describes a class of FPGA-specific uniform random number generators with a 2k −1 length period, which can provide k random bits per-cycle for the cost of k Lookup Ta...
David B. Thomas, Wayne Luk
ATAL
2006
Springer
13 years 11 months ago
Learning a common language through an emergent interaction topology
We study the effects of various emergent topologies of interaction on the rate of language convergence in a population of communicating agents. The agents generate, parse, and lea...
Samarth Swarup, Kiran Lakkaraju, Les Gasser
ICSE
2010
IEEE-ACM
14 years 10 days ago
Is operator-based mutant selection superior to random mutant selection?
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutan...
Lu Zhang, Shan-Shan Hou, Jun-Jue Hu, Tao Xie, Hong...