I need a short bit sequence not more than say 300 bits long. Lower harmonics
are much more important to me. Behind say the 9th I
don't care.
Stupid suggestion:
How about brute force? Use a Genetic Algorithm to guess a bit sequence, express
it's fitness in the product of correlation to the desired output and the RMS of
the lower harmonics calculated as an FFT of the waveform.
To me, it does not matter if the computer have to run for a few days - this
gives time for fun things.
Re: nearest integers to the integer powers of a real number, alternation modulo 2 ... While it is not the same problem as the one you're investigating, the principle of your search space seems similar enough. ... In my case, it was a sequence with N steps to 1, in yours, a consistent even-odd shift.) ... If you consider a perfect fitness function to be one that returns the highest fitness for a sequence with no deviations, subtracing from the fitness for every "missed" number in the resulting sequence, you may be able to use the bits of your starting real as your gene. ... I have a set of template based C++ classes that make the genetic algorithm fairly easy to modify -- you simply have to set the bit-length and override the fitness function. ... (sci.math)
Re: Machine learning ... Since the number of possibilities probably is too large to get the best solution in a reasonable time with brute force, I think a genetic algorithm might be able to solve this. ...Jens Gruschel... (borland.public.delphi.thirdpartytools.general)
Re: SHA1 Question ... > Suppose I have some unknow sequence of 7 bytes. ... > find original 7 bytes sequence used to produce that SHA?... Someone will correct me if I'm wrong, but AFAIK, brute force is the ... (sci.crypt)
Re: How to find the maximum sum of atleast L consecutive integers given a sequence of N integers. ... How can we find the maximum sum of atleast L consecutive integers given ... The brute force approach of forming all possible length sequences at ... Create a new sequence by replacing each run of adjacent positive ... Using the index match this back to the original sequence.... (comp.programming)
Re: Finding minimum in arithmetic series modulo N ...brute force.... Think of where the successive values of the sequence... Now consider only every flooriterations from then on. ... in this sequence increase by some amount r 0 you can now ... (sci.math)
