Research Repository

See what's under the surface


The Countdown Problem (2002)
Journal Article
Hutton, G. (2002). The Countdown Problem. Journal of Functional Programming, 12(6),

We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constraints. Starting from a formal specification of the problem, we present... Read More

'On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems' (2002)
Conference Proceeding
Cayzer, S., & Aickelin, U. (2002). 'On the Effects of Idiotypic Interactions for Recommendation Communities in Artificial Immune Systems'

It has previously been shown that a recommender based on immune system idiotypic principles can outperform one based on correlation alone. This paper reports the results of work in progress, where we undertake some investigations into the nature of t... Read More

A Recommender System based on the Immune Network (2002)
Conference Proceeding
Cayzer, S., & Aickelin, U. (2002). A Recommender System based on the Immune Network

Abstract-The immune system is a complex biological system with a highly distributed, adaptive and self-organising nature. This paper presents an artificial immune system (AIS) that exploits some of these characteristics and is applied to the task of... Read More

The NumbersWithNames Program (2002)
Conference Proceeding
Colton, S., & Dennis, L. A. (2002). The NumbersWithNames Program

We present the NumbersWithNames program which performs data-mining on the Encyclopedia of Integer Sequences to find interesting conjectures in number theory. The program forms conjectures by finding empirical relationships between a sequence chosen... Read More

A Comparison of two Proof Critics: Power vs. Robustness (2002)
Conference Proceeding
Dennis, L. A., & Bundy, A. (2002). A Comparison of two Proof Critics: Power vs. Robustness. In C. A. Munoz, V. A. Carreno, & S. Tahar (Eds.),

Proof critics are a technology from the proof planning paradigm. They examine failed proof attempts in order to extract information which can be used to generate a patch which will allow the proof to go through. We consider the proof of the $quot;wh... Read More

Mapping and Displaying Structural Transformations between XML and PDF (2002)
Conference Proceeding
Hardy, M. R. B., & Brailsford, D. F. (2002). Mapping and Displaying Structural Transformations between XML and PDF. In J. Maletic, R. Furuta, & E. Munson (Eds.),

Documents are often marked up in XML-based tagsets to delineate major structural components such as headings, paragraphs, figure captions and so on, without much regard to their eventual displayed appearance. And yet these same abstract documents, af... Read More

An indirect genetic algorithm for set covering problems (2002)
Journal Article
Aickelin, U. (2002). An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society, 53(10), 1118-1126 . doi:10.1057/palgrave.jors.2601317

This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The gen... Read More

Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm (2002)
Conference Proceeding
Aickelin, U., & Bull, L. (2002). Partnering Strategies for Fitness Evaluation in a Pyramidal Evolutionary Algorithm

This paper combines the idea of a hierarchical distributed genetic algorithm with different inter-agent partnering strategies. Cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising larger parts o... Read More

'An Artificial Immune System as a Recommender System for Web Sites' (2002)
Conference Proceeding
Morrison, T., & Aickelin, U. (2002). 'An Artificial Immune System as a Recommender System for Web Sites'

Artificial Immune Systems have been used successfully to build recommender systems for film databases. In this research, an attempt is made to extend this idea to web site recommendation. A collection of more than 1000 individuals' web profiles (alte... Read More

Hash-Tree Anti-Tampering Schemes (2002)
Conference Proceeding
Moss, B., & Ashman, H. (2002). Hash-Tree Anti-Tampering Schemes

Procedures that provide detection, location and correction of tampering in documents are known as anti-tampering schemes. In this paper we describe how to construct an anti-tampering scheme using a pre-computed tree of hashes. The main problems of co... Read More

Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems (2002)
Book Chapter
Petrovic, S., & Qu, R. (2002). Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems. In Knowledge-Based Intelligent Information Engineering Systems and Allied TechnologiesIOS Press

This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given... Read More

'Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem' (2002)
Journal Article
Aickelin, U., & Dowsland, K. (2002). 'Enhanced Direct and Indirect Genetic Algorithm Approaches for a Mall Layout and Tenant Selection Problem'. Journal of Heuristics, 8(5), doi:10.1023/A:1016536623961

During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance between being an optimiser in its own right and finding feasible solutions.... Read More

Non-Symbolic Fragmentation (2002)
Conference Proceeding
Ashman, H., Coupe, H., Smith, P., Neville-Smith, M., & Gilbert, M. (2002). Non-Symbolic Fragmentation

This paper reports on the use of non-symbolic fragmentation of data for securing communications. Non-symbolic fragmentation, or NSF, relies on breaking up data into non-symbolic fragments, which are (usually irregularly-sized) chunks whose boundaries... Read More

Inductive Theorem Proving and Computer Algebra in the Mathweb Software Bus (2002)
Conference Proceeding
Zimmer, J., & Dennis, L. A. (2002). Inductive Theorem Proving and Computer Algebra in the Mathweb Software Bus. In B. Belaid, J. Calmet, O. Capriotti, L. Hencoque, & V. Sorge (Eds.),

Reasoning systems have reached a high degree of maturity in the last decade. However, even the most successful systems are usually not general purpose problem solvers but are typically specialised on problems in a certain domain. The MathWeb SOftwa... Read More

Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling (2002)
Conference Proceeding
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2002). Knowledge discovery in hyper-heuristic using case-based reasoning on course timetabling

This paper presents a new hyper-heuristic method using Case-Based Reasoning (CBR) for solving course timetabling problems. The term Hyper-heuristics has recently been employed to refer to 'heuristics that choose heuristics' rather than heuristics tha... Read More