XPost: sci.math, comp.theory, bionet.biology.computational   
   From: roberto03@gmail.com   
      
   Hello, i am trying to apply the "simulated annealing" methodology to a   
   problem where i have to determine an optimal (according to some cost   
   function) sequence of N bits, k of which are 1 and (N-k) are 0; i can   
   switch at will the 1's and the 0's between them, but the total number   
   of 1's should be kept constant, say k = N_0, chosen by the user;   
      
   now i'd like to know if anyone has applied this methodology to this   
   kind of problem where one has to optimize a bit string in some sense.   
      
   Thanks for any answer.   
   Roberto.   
      
   [ comp.ai is moderated ... your article may take a while to appear. ]   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)