These are my recent Pin​board​.in links:

• Logic gate — Wikipedia, the free encyclopedia

  For an input of 2 boolean vari­ables, there are 16 pos­si­ble boolean alge­braic func­tions. These 16 func­tions are enu­mer­ated below, together with their out­puts for each com­bi­na­tion of input variables.
  
  Boolean-​​logic logic-​​gates pragmatic-​​gp for-​​the-​​book Game-​​of-​​Life

• [0812.4170] Find­ing Still Lifes with Memetic/​Exact Hybrid Algorithms

  “The max­i­mum den­sity still life prob­lem (MDSLP) is a hard con­straint opti­miza­tion prob­lem based on Conway’s game of life. It is a prime exam­ple of weighted con­strained opti­miza­tion prob­lem that has been recently tack­led in the constraint-​​programming com­mu­nity. Bucket elim­i­na­tion (BE) is a com­plete tech­nique com­monly used to solve this kind of con­straint sat­is­fac­tion prob­lem. When the mem­ory required to apply BE is too high, a heuris­tic method based on it (denom­i­nated mini-​​buckets) can be used to cal­cu­late bounds for the opti­mal solu­tion. Nev­er­the­less, the curse of dimen­sion­al­ity makes these tech­niques unprac­ti­cal for large size prob­lems. In response to this sit­u­a­tion, we present a memetic algo­rithm for the MDSLP in which BE is used as a mech­a­nism for recom­bin­ing solu­tions, pro­vid­ing the best pos­si­ble child from the parental set. Sub­se­quently, a multi-​​level model in which this exact/​metaheuristic hybrid is fur­ther hybridized with branch-​​and-​​bound tech­niques and mini-​​buckets is stud­ied. Exten­sive exper­i­men­tal results ana­lyze the per­for­mance of these mod­els and multi-​​parent recom­bi­na­tion. The result­ing algo­rithm con­sis­tently finds opti­mal pat­terns for up to date solved instances in less time than cur­rent approaches. More­over, it is shown that this pro­posal pro­vides new best known solu­tions for very large instances.”
  
  prag­mat­icGP game-​​of-​​life cellular-​​automata opti­miza­tion discrete-​​mathematics via:jj