Sciweavers

3257 search results - page 130 / 652
» Some Results on Effective Randomness
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
14 years 10 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
GLOBECOM
2006
IEEE
15 years 4 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang
BIB
2007
59views more  BIB 2007»
14 years 10 months ago
Statistically designing microarrays and microarray experiments to enhance sensitivity and specificity
Gene expression signatures from microarray experiments promise to provide important prognostic tools for predicting disease outcome or response to treatment. A number of microarra...
Jason C. Hsu, Jane Chang, Tao Wang, Eiríkur...
CANDC
2004
ACM
14 years 9 months ago
Stochastic approaches for modelling in vivo reactions
In recent years, stochastic modelling has emerged as a physically more realistic alternative for modelling in vivo reactions. There are numerous stochastic approaches available in...
Thomas E. Turner, Santiago Schnell, Kevin Burrage
CRYPTO
2005
Springer
163views Cryptology» more  CRYPTO 2005»
15 years 3 months ago
On the Generic Insecurity of the Full Domain Hash
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
Yevgeniy Dodis, Roberto Oliveira, Krzysztof Pietrz...