Sciweavers

7228 search results - page 317 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
15 years 4 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
IJON
2010
199views more  IJON 2010»
15 years 2 months ago
DFS-generated pathways in GA crossover for protein structure prediction
Genetic Algorithms (GAs), as nondeterministic conformational search techniques, are promising for solving protein structure prediction (PSP) problems. The crossover operator of a ...
Tamjidul Hoque, Madhu Chetty, Andrew Lewis, Abdul ...
STOC
2001
ACM
140views Algorithms» more  STOC 2001»
16 years 5 months ago
Compatible sequences and a slow Winkler percolation
Two infinite 0-1 sequences are called compatible when it is possible to cast out 0's from both in such a way that they become complementary to each other. Answering a question...
Péter Gács
ICN
2005
Springer
15 years 10 months ago
Network Traffic Sampling Model on Packet Identification
Spatially coordinated packet sampling can be implemented by using a deterministic function of packet content to determine the selection decision for a given packet. In this way, a...
Guang Cheng, Jian Gong, Wei Ding 0001
SIGIR
2008
ACM
15 years 4 months ago
A simple and efficient sampling method for estimating AP and NDCG
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam