534 search results - page 8 / 107 » Power from Random Strings |
COMBINATORICS
2004
13 years 7 months ago
2004
A natural problem in extremal combinatorics is to maximize the number of distinct subsequences for any length-n string over a finite alphabet ; this value grows exponentially, but...
ICALP
2004
Springer
14 years 22 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled ...
AINA
2009
IEEE
13 years 11 months ago
2009
IEEE
The use of wireless sensor networks (WSNs) for structural health monitoring is gaining popularity since it allows for a low-cost, rapid and robust assessment of structural integri...
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
Chemical Genetic Programming (CGP) is a new method of genetic programming that introduced collision-based biochemical processes and realized dynamic mapping from genotypic strings ...