Sciweavers

1457 search results - page 137 / 292
» On the Uniform Distribution of Strings
Sort
View
PG
2007
IEEE
16 years 26 days ago
Precomputed Visibility Cuts for Interactive Relighting with Dynamic BRDFs
This paper presents a novel PRT-based method that uses precomputed visibility cuts for interactive relighting with all-frequency environment maps and arbitrary dynamic BRDFs. Our ...
Oskar Åkerlund, Mattias Unger, Rui Wang
ISSTA
2006
ACM
16 years 16 days ago
Path-oriented random testing
Test campaigns usually require only a restricted subset of paths in a program to be thoroughly tested. As random testing (RT) offers interesting fault-detection capacities at low ...
Arnaud Gotlieb, Matthieu Petit
INFOCOM
2005
IEEE
16 years 5 days ago
Non-uniform random membership management in peer-to-peer networks
Abstract— Existing random membership management algorithms provide each node with a small, uniformly random subset of global participants. However, many applications would beneï¬...
Ming Zhong, Kai Shen, Joel I. Seiferas
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
16 years 1 days ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
CP
2004
Springer
15 years 12 months ago
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...
Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoo...