Graham Kendall
Various Images

Professor Graham Kendall

Professor Graham Kendall is the Provost and CEO of The University of Nottingham Malaysia Campus (UNMC). He is also a Pro-Vice Chancellor of the University of Nottingham.

He is a Director of MyResearch Sdn Bhd, Crops for the Future Sdn Bhd. and Nottingham Green Technologies Sdn Bhd. He is a Fellow of the British Computer Society (FBCS) and a Fellow of the Operational Research Society (FORS).

He has published over 230 peer reviewed papers. He is an Associate Editor of 10 journals and the Editor-in-Chief of the IEEE Transactions of Computational Intelligence and AI in Games.

News

I have published some papers on timetabling.
http://bit.ly/hSGAhZ
I have published a few papers on Sports Scheduling.
http://bit.ly/gVaUqT

Latest Blog Post

Snooker: Celebrating 40 years at the Crucible

Random Blog Post

Prediction of sporting events: A Scientific Approach

Publication(s)

General Video Game Playing
http://bit.ly/1a2Vjvz
Barriers to implementation of IT in educational institutions
http://bit.ly/1zUkd8s
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem
http://bit.ly/egxt0d
When Sports Rules Go Awry
http://bit.ly/2ehzLjV

Graham Kendall: Details of Requested Publication


Citation

Petrovic, S; Kendall, G and Yang, Y A Tabu Search Approach for Graph-Structured Case Retrieval. In Proceedings of the STarting Artificial Intelligence Researches Symposium (STAIRS 2002), pages 55-64, IOS Press, Lyon, France, 22-23 July, 2002.


Abstract

In case-based reasoning (CBR), graph-structured representations are desirable for complex application domains such as planning and design. Graph is a powerful data structure and allows knowledge to be encoded completely and expressively. However, the advantages come with a computational overhead for case retrieval, which presently prevents the usage of graph-structured representation for large-scale problems. In this paper, we describe a two-stage strategy that is based on the tabu search for solving the graph-structured case retrieval. The experiments were performed on synthetically generated graphs. The preliminary results obtained show the effectiveness of our approach.


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{pky2002, author = {S. Petrovic and G. Kendall and Y. Yang},
title = {A Tabu Search Approach for Graph-Structured Case Retrieval},
booktitle = {Proceedings of the STarting Artificial Intelligence Researches Symposium (STAIRS 2002)},
year = {2002},
editor = {T. Vidal and P. Liberatore},
pages = {55--64},
address = {Lyon, France, 22-23 July},
publisher = {IOS Press},
abstract = {In case-based reasoning (CBR), graph-structured representations are desirable for complex application domains such as planning and design. Graph is a powerful data structure and allows knowledge to be encoded completely and expressively. However, the advantages come with a computational overhead for case retrieval, which presently prevents the usage of graph-structured representation for large-scale problems. In this paper, we describe a two-stage strategy that is based on the tabu search for solving the graph-structured case retrieval. The experiments were performed on synthetically generated graphs. The preliminary results obtained show the effectiveness of our approach.},
comment = {ISBN 1-58603-259-3},
keywords = {Case Based Reasoning, CBR, graph, tabu search},
timestamp = {2007.03.29},
webpdf = {http://www.graham-kendall.com/papers/pky2002.pdf} }