The Recode of the sat-problem

2014 07 11

   Do it in the room before get the holiday,and set up a little software and prepare to the lab.

2014 07 18

   Solve the problem with theintel_way.

1. Using the local search to getthe max value before the ML;

2. Collect the data about (xi, yi)and builds the function which can predict the value of xi according to yi, inorder to control the value of x in [0, 1], we using the 0-1 function(1/(1+e^y)),(Sometimes, people use (e^tanx-e^-tanx)/(e^tanx+e^-tanx))

3.10*10*100 data

2014 07 25

   Main in the GSA.

1. Plane way

  2. Cube way

  3. Test data only few, maybe less than 6

  4. Easy to local in the local_best, andusually get into the 377-382 when m=400.

 The main alg was count the F one planet get,and count it’s ‘a’ for its power.

Adv. We can usethe walk sat, and also, we need to better it.

   Gathering way.

Read Data;

数据相关性分析

More think:

求最大覆盖性问题,每个元素覆盖n个子句,求任意组合的n个元素所能做出的最大覆盖问题，

构造一个子句被覆盖的所有元素，再根据最少被覆盖的子句开始

 

猜测->搜索->预测->验证->学习(再作用)->(中间状态)->预测->验证