Evolutionary scheduling: a review.
Journal Article
Hart, E., Ross, P., & Corne, D. (2005)
Evolutionary scheduling: a review. Genetic Programming and Evolvable Machines, 6, 191-220. https://doi.org/10.1007/s10710-005-7580-7
Early and seminal work which applied evolutionary computing methods to scheduling problems from 1985 onwards laid a strong and exciting foundation for the work which has been ...
The impact of the shape of antibody recognition regions on the emergence of idiotypic networks.
Journal Article
Hart, E. & Ross, P. (2005)
The impact of the shape of antibody recognition regions on the emergence of idiotypic networks. International Journal of Unconventional Computing. 1, 281-313. ISSN 1548-7199
One of the components of an AIS algorithm that most distinguishes it from other paradigms is the use of an affinity funciton. However, for the most part, the implications of c...
Genetic algorithms and timetabling
Book Chapter
Ross, P., Hart, E., & Corne, D. (2003)
Genetic algorithms and timetabling. In A. Ghosh, & K. Tsutsui (Eds.), Advances in Evolutionary Optimisation. Springer. https://doi.org/10.1007/978-3-642-18965-4_30
Genetic algorithms can be used to search very large spaces, and it would seem natural to use them for tackling the nastier kinds of timetabling problem. We completed an EPSRC-...
Hyper Heuristics: an emerging direction in modern search technology.
Book Chapter
Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., & Schulenburg, S. (2003)
Hyper Heuristics: an emerging direction in modern search technology. In F. Glover, & G. A. Kochenberger (Eds.), Handbook of MetaHeuristics, 457-474. Springer US. https://doi.org/10.1007/0-306-48056-5_16
Requirements for getting a robot to grow-up
Conference Proceeding
Ross, P., Hart, E., Lawson, A., Webb, A., Prem, E., Poelz, P., & Morgavi, G. (2003)
Requirements for getting a robot to grow-up. In W. Banzhaf, T. Christaller, P. Dittrich, J. T. Kim, & J. Ziegler (Eds.), Advances in Artificial Life 7th European Conference, ECAL 2003, Dortmund, Germany, September 14-17, 2003. Proceedings. , (847-856). https://doi.org/10.1007/978-3-540-39432-7_91
Much of current robot research is about learning tasks in which the task to be achieved is pre-specified, a suitable technology for the task is chosen and the learning process...
Exploiting the analogy between the immune system and sparse distributed memory.
Journal Article
Hart, E., & Ross, P. (2002)
Exploiting the analogy between the immune system and sparse distributed memory. Genetic Programming and Evolvable Machines, 4(4), 333-358. doi:10.1023/a:1026191011609
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...
A role for immunology in 'next generation' robots.
Conference Proceeding
Hart, E., Ross, P., Webb, A., & Lawson, A. (2003)
A role for immunology in 'next generation' robots. In J. Timmis, P. Bentley, & E. Hart (Eds.), Artificial Immune Systems. ICARIS 2003, 46-56. https://doi.org/10.1007/978-3-540-45192-1_5
Much of current robot research is about learning tasks in which the task to be achieved is pre-specified, a suitable technology for the task is chosen and the learning process...
Controlling a simulated Khepera with an XCS classifier system with memory.
Conference Proceeding
Webb, A., Hart, E., Ross, P. & Lawson, A. (2003)
Controlling a simulated Khepera with an XCS classifier system with memory. ISBN 9783540200574
Autonomous agents commonly suffer from perceptual aliasing in which differing situations are perceived as identical by the robots sensors, yet require different courses of act...
Requirements for getting a robot to grow up.
Conference Proceeding
Ross, P., Hart, E., Lawson, A., Webb, A., Prem, E., Poelz, P. & Morgavi, G. (2003)
Requirements for getting a robot to grow up. ISBN 9783540200574
Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics.
Conference Proceeding
Ross, P., Marin-Blazquez, J. G., Schulenburg, S. & Hart, E. (2003)
Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics
The idea underlying hyper-heuristics is to discover some
combination of familiar, straightforward heuristics that performs very well across a whole range of problems. To be wo...