909 search results - page 94 / 182 » Games for extracting randomness |
107
click to vote
COGSCI
2004
15 years 4 months ago
2004
People spontaneously discover new representations during problem solving. Discovery of a mathematical representation is of special interest, because it shows that the underlying s...
111
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
150
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
139
Voted
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
152
click to vote
CEC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...