In close collaboration with Seoul National University's Structural Complexity Laboratory

 

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
research:publications [2012/03/17 03:50]
rim [Refereed Conference Papers]
research:publications [2012/03/17 04:24]
rim [Refereed Conference Papers]
Line 149: Line 149:
   - Shan, Y, //McKay, R I (Bob)//, Lokan, C J, Essam, D L, {{:​papers:​Shan2002ICCCAS.pdf|Software Project Effort Estimation Using Genetic Programming,​ }}in IEEE International Conference on Communications,​ Circuits and Systems, ​ **2** IEEE Press June 29-July 1 2002, Pp. 1108-1112[[http://​citeseer.ist.psu.edu/​545689.html|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Shan2002ICCCAS.bib|bibtex]]   - Shan, Y, //McKay, R I (Bob)//, Lokan, C J, Essam, D L, {{:​papers:​Shan2002ICCCAS.pdf|Software Project Effort Estimation Using Genetic Programming,​ }}in IEEE International Conference on Communications,​ Circuits and Systems, ​ **2** IEEE Press June 29-July 1 2002, Pp. 1108-1112[[http://​citeseer.ist.psu.edu/​545689.html|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Shan2002ICCCAS.bib|bibtex]]
   - Nguyen, X H, //McKay, R I (Bob)//, Essam, D L, {{:​papers:​Nguyen2002ICCCS.pdf|Can Tree Adjunct Grammar Guided Genetic Programming be Good at Finding a Needle in a Haystack? A Case Study, }}in IEEE International Conference on Communications,​ Circuits and Systems, ​ **2** IEEE Press July 2002, Pp. 1113-1117[[http://​ieeexplore.ieee.org/​search/​searchresult.jsp?​SortField=Score&​SortOrder=desc&​ResultCount=25&​maxdoc=100&​coll1=&​coll2=ieeecnfs&​coll3=ieecnfs&​coll4=&​coll5=&​coll6=&​coll7=&​coll8=&​srchres=0&​isonlybook=yes&​history=yes&​queryText=%28ESSAM%3CIN%3Emetadata%29&​oldqrytext=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​imageField.x=27&​imageField.y=13&​imageField=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​radiobutton=cit|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Nguyen2002ICCCS.bib|bibtex]]   - Nguyen, X H, //McKay, R I (Bob)//, Essam, D L, {{:​papers:​Nguyen2002ICCCS.pdf|Can Tree Adjunct Grammar Guided Genetic Programming be Good at Finding a Needle in a Haystack? A Case Study, }}in IEEE International Conference on Communications,​ Circuits and Systems, ​ **2** IEEE Press July 2002, Pp. 1113-1117[[http://​ieeexplore.ieee.org/​search/​searchresult.jsp?​SortField=Score&​SortOrder=desc&​ResultCount=25&​maxdoc=100&​coll1=&​coll2=ieeecnfs&​coll3=ieecnfs&​coll4=&​coll5=&​coll6=&​coll7=&​coll8=&​srchres=0&​isonlybook=yes&​history=yes&​queryText=%28ESSAM%3CIN%3Emetadata%29&​oldqrytext=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​imageField.x=27&​imageField.y=13&​imageField=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​radiobutton=cit|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Nguyen2002ICCCS.bib|bibtex]]
-  - Wang, B, //McKay, R I (Bob)//, Abbass, H A, Barlow, M, {{:​papers:​wang2002icccs.pdf|}}{{:​papers:​Wang2002ICCCS.pdf|Learning Text Classifier using the Domain Concept Hierarchy, }}in IEEE International Conference on Communications,​ Circuits and Systems, ​ **2** IEEE Press July 2002, Pp. 1230-1234[[http://​ieeexplore.ieee.org/​xpls/​abs_all.jsp?​arnumber=1179005|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Wang2002ICCCS.bib|bibtex]]+  - Wang, B, //McKay, R I (Bob)//, Abbass, H A, Barlow, M, {{:​papers:​Wang2002ICCCS.pdf|Learning Text Classifier using the Domain Concept Hierarchy, }}in IEEE International Conference on Communications,​ Circuits and Systems, ​ **2** IEEE Press July 2002, Pp. 1230-1234[[http://​ieeexplore.ieee.org/​xpls/​abs_all.jsp?​arnumber=1179005|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Wang2002ICCCS.bib|bibtex]]
   - Nguyen, X H, //McKay, R I (Bob)//, Essam, D L, Chau, R M, {{:​papers:​hoai2002stsrpwtgggptcr.pdf|Solving the Symbolic Regression Problem with Tree-Adjunct Grammar Guided Genetic Programming:​ The Comparative Results, }}in Fogel, D B and El-Sharkawi,​ M A and Yao, X and Greenwood, G and Iba, H and Marrow, P and Shackleton, M (eds), Proceedings,​ 2002 World Congress on Computational Intelligence, ​ **2** IEEE Press 2002, Pp. 1326-1333[[http://​ieeexplore.ieee.org/​xpl/​freeabs_all.jsp?​arnumber=1004435&​fromcon|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​hoai2002stsrpwtgggptcr.bib|bibtex]]   - Nguyen, X H, //McKay, R I (Bob)//, Essam, D L, Chau, R M, {{:​papers:​hoai2002stsrpwtgggptcr.pdf|Solving the Symbolic Regression Problem with Tree-Adjunct Grammar Guided Genetic Programming:​ The Comparative Results, }}in Fogel, D B and El-Sharkawi,​ M A and Yao, X and Greenwood, G and Iba, H and Marrow, P and Shackleton, M (eds), Proceedings,​ 2002 World Congress on Computational Intelligence, ​ **2** IEEE Press 2002, Pp. 1326-1333[[http://​ieeexplore.ieee.org/​xpl/​freeabs_all.jsp?​arnumber=1004435&​fromcon|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​hoai2002stsrpwtgggptcr.bib|bibtex]]
-  - Abbass, H, Nguyen, X H, //McKay, R I (Bob)//, ​{{:​papers:​abbass2002wcci.pdf|}}{{:​papers:​Abbass2002WCCI.pdf|AntTAG:​ A New Method to Compose Computer Programs Using Colonies of Ants, }}in Proceedings,​ 2002 World Congress on Computational Intelligence, ​ **2** IEEE Press 2002, Pp. 1654-1666[[http://​ieeexplore.ieee.org/​search/​searchresult.jsp?​SortField=Score&​SortOrder=desc&​ResultCount=25&​maxdoc=100&​coll1=&​coll2=ieeecnfs&​coll3=ieecnfs&​coll4=&​coll5=&​coll6=&​coll7=&​coll8=&​srchres=0&​isonlybook=yes&​history=yes&​queryText=%28abbass%3CIN%3Emetadata%29&​oldqrytext=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​imageField.x=14&​imageField.y=3&​imageField=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​radiobutton=cit|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Abbass2002WCCI.bib|bibtex]]+  - Abbass, H, Nguyen, X H, //McKay, R I (Bob)//, {{:​papers:​Abbass2002WCCI.pdf|AntTAG:​ A New Method to Compose Computer Programs Using Colonies of Ants, }}in Proceedings,​ 2002 World Congress on Computational Intelligence, ​ **2** IEEE Press 2002, Pp. 1654-1666[[http://​ieeexplore.ieee.org/​search/​searchresult.jsp?​SortField=Score&​SortOrder=desc&​ResultCount=25&​maxdoc=100&​coll1=&​coll2=ieeecnfs&​coll3=ieecnfs&​coll4=&​coll5=&​coll6=&​coll7=&​coll8=&​srchres=0&​isonlybook=yes&​history=yes&​queryText=%28abbass%3CIN%3Emetadata%29&​oldqrytext=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​imageField.x=14&​imageField.y=3&​imageField=%28mckay+%3Cin%3E+au%29+%3Cand%3E+%2826511+%3Cin%3E+isnumber%29&​radiobutton=cit|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Abbass2002WCCI.bib|bibtex]]
   - Liu, B, Abbass, H, //McKay, R I (Bob)//, {{:​papers:​Liu2002ajwies.pdf|Density-Based Heuristic for Rule Discovery with Ant-Miner, }}in Proceedings of the Australasia-Japan Workshop on Intelligent and Evolutionary Systems, ​ 2002, Pp. 180-184[[http://​structuredcomplexity.org/​BIB/​BIBS/​Liu2002ajwies.bib|bibtex]]   - Liu, B, Abbass, H, //McKay, R I (Bob)//, {{:​papers:​Liu2002ajwies.pdf|Density-Based Heuristic for Rule Discovery with Ant-Miner, }}in Proceedings of the Australasia-Japan Workshop on Intelligent and Evolutionary Systems, ​ 2002, Pp. 180-184[[http://​structuredcomplexity.org/​BIB/​BIBS/​Liu2002ajwies.bib|bibtex]]
   - Shan, Y, Abbass, H, //McKay, R I (Bob)//, Essam, D, {{:​papers:​Shan2002AJJW.pdf|AntTAG:​ A Further Study, }}in Sarker, R and McKay R I (eds), Proceedings of the 6th Australasia-Japan Joint Workshop on Intelligent and Evolutionary Systems, ​ Nov 30 2002, Pp. 133-140[[http://​www.cs.bham.ac.uk/​ wbl/​biblio/​gp-html/​shan_2002_AJJW.html|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Shan2002AJJW.bib|bibtex]]   - Shan, Y, Abbass, H, //McKay, R I (Bob)//, Essam, D, {{:​papers:​Shan2002AJJW.pdf|AntTAG:​ A Further Study, }}in Sarker, R and McKay R I (eds), Proceedings of the 6th Australasia-Japan Joint Workshop on Intelligent and Evolutionary Systems, ​ Nov 30 2002, Pp. 133-140[[http://​www.cs.bham.ac.uk/​ wbl/​biblio/​gp-html/​shan_2002_AJJW.html|Link]][[http://​structuredcomplexity.org/​BIB/​BIBS/​Shan2002AJJW.bib|bibtex]]