A genetic algorithm solver for the 0-1 knapsack problem.
Developed for the A.I. - Functional Programming class at University of Perugia in OCaml by Claudio Tanci.
SHOW FULL COLUMNS FROM `jrk_downrecords` [ RunTime:0.018529s ]
SELECT `a`.`aid`,`a`.`title`,`a`.`create_time`,`m`.`username` FROM `jrk_downrecords` `a` INNER JOIN `jrk_member` `m` ON `a`.`uid`=`m`.`id` WHERE `a`.`status` = 1 GROUP BY `a`.`aid` ORDER BY `a`.`create_time` DESC LIMIT 10 [ RunTime:0.140410s ]
SHOW FULL COLUMNS FROM `jrk_tagrecords` [ RunTime:0.001997s ]
SELECT * FROM `jrk_tagrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 20 [ RunTime:0.001905s ]
SHOW FULL COLUMNS FROM `jrk_member` [ RunTime:0.001166s ]
SELECT `id`,`username`,`userhead`,`usertime` FROM `jrk_member` WHERE `status` = 1 ORDER BY `usertime` DESC LIMIT 10 [ RunTime:0.003766s ]
SHOW FULL COLUMNS FROM `jrk_searchrecords` [ RunTime:0.001226s ]
SELECT * FROM `jrk_searchrecords` WHERE `status` = 1 ORDER BY `num` DESC LIMIT 5 [ RunTime:0.004432s ]
SELECT aid,title,count(aid) as c FROM `jrk_downrecords` GROUP BY `aid` ORDER BY `c` DESC LIMIT 10 [ RunTime:0.054862s ]
SHOW FULL COLUMNS FROM `jrk_articles` [ RunTime:0.003322s ]
UPDATE `jrk_articles` SET `hits` = 2 WHERE `id` = 252779 [ RunTime:0.077059s ]
