Sciweavers

4103 search results - page 534 / 821
» Some results on the Collatz problem
Sort
View
ECCC
2010
95views more  ECCC 2010»
15 years 6 months ago
Bounded-depth circuits cannot sample good codes
We study a variant of the classical circuit-lower-bound problems: proving lower bounds for sampling distributions given random bits. We prove a lower bound of 1 - 1/n(1) on the st...
Shachar Lovett, Emanuele Viola
DM
2008
100views more  DM 2008»
15 years 6 months ago
Cyclic sequences of k-subsets with distinct consecutive unions
In this paper, we investigate cyclic sequences which contain as elements all k-subsets of {0, 1, . . . , n-1} exactly once such that the unions of any two consecutive k-subsets of...
Meinard Müller, Masakazu Jimbo
EAAI
2008
106views more  EAAI 2008»
15 years 6 months ago
The distributed multilevel ant-stigmergy algorithm used at the electric-motor design
This article presents an optimization method used at the electric-motor design. The goal of the optimization was to find the geometrical parameter values that would generate the r...
Peter Korosec, Jurij Silc
ECCC
2008
98views more  ECCC 2008»
15 years 6 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
ESWA
2008
113views more  ESWA 2008»
15 years 6 months ago
Taxonomy alignment for interoperability between heterogeneous virtual organizations
Resources in virtual organizations are classified based on their local taxonomies. However, heterogeneity between these taxonomies is a serious problem for efficient cooperation p...
Jason J. Jung