This a GA implementation using binary and real coded variables. Mixed variables can be used. Constraints can also be handled. All constraints must be greater-than-equal-to type (g >= 0) and normalized (see the sample problem in prob1 in objective()).
香港大學(xué)的David W.Cheung寫的“A General Incremental Technique for Maintaining Discovered Association Rules”中提到的FUP2算法,用來解決數(shù)據(jù)庫(kù)更新后的關(guān)聯(lián)規(guī)則挖掘
tty驅(qū)動(dòng) * This driver shows how to create a minimal tty driver. It does not rely on * any backing hardware, but creates a timer that emulates data being received * from some kind of hardware.