Tags: qzcwx/WalLS

diable the equal move

* since there is not mechanism for preventing stupid moves

Generate correct results in 1.49e+00s

Add better command line interface

Implement supm with unrestricted buffer and p

as described in GECCO paper, the evaluation is the same as wal-fit

Version for testing solution and runtime in Cray

Perfect version

Everything runs superfast and correctly.

Using Elementary Landcape Analysis for Wal-Mean

Add the tracking of bit flip times

Search on SC, speed up mean-wal significantly

Search only on S

Successfully implement my idea

A(N(y_p)) = A(N(x)) - S_p(x) + 4/N* \sigma_{i=1}^{N}
	C_{ip}: be careful with C_{ii}, i \in N