DM
2002
14 years 6 months ago
2002
We show that the average size of subsets of [n] forming an intersecting Sperner family of cardinality not less than (n-1 k-1 ) is at least k provided that k 6 n=2
CPM
2009
Springer
14 years 7 months ago
2009
Springer
Factor and suffix oracles have been introduced in [1] in order to provide an economic and efficient solution for storing all the factors and suffixes respectively of a given text. ...
GECCO
2004
Springer
15 years 37 min ago
2004
Springer
Abstract. Bloat is a common and well studied problem in genetic programming. Size and depth limits are often used to combat bloat, but to date there has been little detailed explor...
ICC
2009
IEEE
15 years 1 months ago
2009
IEEE
—An efficient way to bound the size of clusters in large-scale self-organizing wireless networks is to rely on a budget-based strategy. The side effect of conventional budgetbas...