All Outputs (7)

Exploiting the analogy between immunology and sparse distributed memory. (2002)
Presentation / Conference Contribution
Hart, E., & Ross, P. (2002). Exploiting the analogy between immunology and sparse distributed memory. In J. Timmis, & P. J. Bentley (Eds.), ICARIS 2002 : 1st International Conference on Artificial Immune Systems (59-67)

The relationship between immunological memory and a class of associative memories known as sparse distributed memories (SDM) is well known. This paper proposes a new model for clustering non-stationary data based on a combination of salient features... Read More about Exploiting the analogy between immunology and sparse distributed memory..

Combining choices of heuristics. (2002)
Book Chapter
Ross, P., & Hart, E. (2002). Combining choices of heuristics. In R. Sarker, M. Mohammadian, & X. Yao (Eds.), Evolutionary Optimization (229-252). Kluwer

Multiple-goal learning in robots using the MAXSON neural network architecture. (2002)
Presentation / Conference Contribution
Webb, A., Ross, P., & Hart, E. (2002). Multiple-goal learning in robots using the MAXSON neural network architecture. In B. Hallam, D. Floreano, G. Hayes, J. A. Meyere, & J. Hallam (Eds.), SAB'02 Workshop: On Growing Up Artifacts that Live - Basic Princip

No abstract available.

Solving a real world routing problem using multiple evolutionary algorithms. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Solving a real world routing problem using multiple evolutionary algorithms. In Parallel Problem Solving from Nature — PPSN VII (871-880). https://doi.org/10.1007/3-540-45712-7_84

This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are invest... Read More about Solving a real world routing problem using multiple evolutionary algorithms..

Solving a real world routing problem using evolutionary agents. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Solving a real world routing problem using evolutionary agents.

This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is proposed and mechanisms for controlling the interactions of agents are invest... Read More about Solving a real world routing problem using evolutionary agents..

Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. (2002)
Presentation / Conference Contribution
Ross, P., Schulenburg, S., Marin-Blazquez, J. G., & Hart, E. (2002). Hyper-heuristics: learning to combine simple heuristics in bin-packing problems.

Evolutionary algorithms (EAs) often appear to be a ‘black box’, neither offering worst-case bounds nor any guarantee of optimality when used to solve individual problems. They can also take much longer than non-evolutionary methods. We try to addres... Read More about Hyper-heuristics: learning to combine simple heuristics in bin-packing problems..

Improving street based routing using building block mutations. (2002)
Presentation / Conference Contribution
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002). Improving street based routing using building block mutations. In J. Gottlieb, E. Hart, & S. Cagnoni (Eds.), Applications of Evolutionary Computing: EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTI

Street based routing (SBR) is a real-world inspired routing problem that builds routes within an urban area for mail deliveries. The authors have previously attempted to solve this problem using an Evolutionary Algorithm (EA). In this paper the autho... Read More about Improving street based routing using building block mutations..