Sciweavers

1806 search results - page 344 / 362
» Randomness and halting probabilities
Sort
View
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 10 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
169
Voted
PODC
2010
ACM
15 years 10 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
ASIAN
2004
Springer
153views Algorithms» more  ASIAN 2004»
15 years 10 months ago
Chi-Square Matrix: An Approach for Building-Block Identification
This paper presents a line of research in genetic algorithms (GAs), called building-block identification. The building blocks (BBs) are common structures inferred from a set of sol...
Chatchawit Aporntewan, Prabhas Chongstitvatana
ECML
2004
Springer
15 years 10 months ago
Population Diversity in Permutation-Based Genetic Algorithm
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
Kenny Qili Zhu, Ziwei Liu
CIKM
2006
Springer
15 years 10 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum