2084 search results - page 164 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
145
click to vote
DKE
2002
15 years 4 months ago
2002
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
167
click to vote
EC
2006
15 years 5 months ago
2006
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
152
click to vote
EUROCOLT
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algori...
160
click to vote
COCO
2005
Springer
15 years 10 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
147
Voted
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...