Graham Kendall

TL;DR: The first Cross-domain Heuristic Search Challenge (CHeSC 2011) seeks to bring together practitioners from operational research, computer science and artificial intelligence who are interested in developing more generally applicable search methodologies.

TL;DR: A categorisation of the methodologies conducted in recent years based on chronology, category and application (dataset) is presented and the industrial perspective, trends and future direction in high school timetabling optimisation problems are outlined.

TL;DR: In this article, the authors used two two-dimensional packing problems to illustrate how this information can be incorporated into the genetic operators to improve the overall performance of the search, and used the packing problems as a vehicle for investigating a series of modifications of the genetic algorithm approach based on information from bounds on partial solutions.

TL;DR: It is shown that a strategy that uses simple rule-based identification mechanisms to explore and exploit the opponent outperforms well-known strategies such as tit-for-tat (TFT) in most round-robin IPD competitions.

TL;DR: “RTAnews” is introduced, a new benchmark dataset of multi-label Arabic news articles for text categorization and other supervised learning tasks, and an extensive comparison of most of the well-known multi- label learning algorithms for ArabicText categorization is conducted.