All Outputs (13)

The Generic Approximation Lemma (2001)
Journal Article
Hutton, G., & Gibbons, J. (2001). The Generic Approximation Lemma. Information Processing Letters, 79(4),

The approximation lemma is a simplification of the well-known take lemma, and is used to prove properties of programs that produce lists of values. We show how the approximation lemma, unlike the take lemma, can naturally be generalised from lists t... Read More about The Generic Approximation Lemma.

Hybrid population-based metaheuristic approaches for the space allocation problem (2001)
Conference Proceeding
Burke, E. K., Cowling, P., & Landa Silva, J. D. (2001). Hybrid population-based metaheuristic approaches for the space allocation problem. In Proceedings of the 2001 Congress on Evolutionary Computation, (232-239). https://doi.org/10.1109/CEC.2001.934394

A hybrid population-based metaheuristic for the space allocation problem in academic institutions is presented that is based upon previous experiments using a range of techniques including hill-climbing, simulated annealing, tabu search and genetic a... Read More about Hybrid population-based metaheuristic approaches for the space allocation problem.

When is a function a fold or an unfold? (2001)
Conference Proceeding
Gibbons, J., Hutton, G., & Altenkirch, T. (2001). When is a function a fold or an unfold?.

We give a necessary and sufficient condition for when a set-theoretic function can be written using the recursion operator fold, and a dual condition for the recursion operator unfold. The conditions are simple, practically useful, and generic in the... Read More about When is a function a fold or an unfold?.

Camping in the digital wilderness: Tents and flashlights as interfaces to virtual worlds (2001)
Presentation / Conference
Green, J., Schnädelbach, H., Koleva, B., Benford, S., Pridmore, T., Medina, K., …Smith, H. (2001, April). Camping in the digital wilderness: Tents and flashlights as interfaces to virtual worlds. Paper presented at Conference on Human Factors in Computing Systems - Proceedings

A projection screen in the shape of a tent provides children with a shared immersive experience of a virtual world based on the metaphor of camping. RFID aerials at its entrances sense tagged children and objects as they enter and leave. Video tracki... Read More about Camping in the digital wilderness: Tents and flashlights as interfaces to virtual worlds.

Three methods to automate the space allocation process in UK universities (2001)
Book Chapter
Burke, E. K., Cowling, P., Landa Silva, J. D., & McCollum, B. (2001). Three methods to automate the space allocation process in UK universities. In Evolutionary Multi-Criterion Optimization: 5th International Conference, EMO 2009, Nantes, France, April 7-10, 2009. Proceedings, (254-273). Springer Verlag. https://doi.org/10.1007/978-3-642-01020-0_38

The space allocation problem within UK universities is highly constrained, has multiple objectives, varies greatly among different institutions, requires frequent modifications and has a direct impact on the functionality of the university. As in eve... Read More about Three methods to automate the space allocation process in UK universities.

A pyramidal evolutionary algorithm with different inter-agent partnering strategies for scheduling problems (2001)
Conference Proceeding
Aickelin, U. (2001). A pyramidal evolutionary algorithm with different inter-agent partnering strategies for scheduling problems.

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 about A pyramidal evolutionary algorithm with different inter-agent partnering strategies for scheduling problems.

A Pyramidal Genetic Algorithm for Multiple-Choice Problems (2001)
Conference Proceeding
Aickelin, U. (2001). A Pyramidal Genetic Algorithm for Multiple-Choice Problems.

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 about A Pyramidal Genetic Algorithm for Multiple-Choice Problems.

Representations of first order function types as terminal coalgebras (2001)
Conference Proceeding
Altenkirch, T. (2001). Representations of first order function types as terminal coalgebras.

New Directions in Commercial Secrecy and Encryption Protocols (2001)
Conference Proceeding
Ashman, H. (2001). New Directions in Commercial Secrecy and Encryption Protocols.

Secure transmission of bulk data is of interest to many content providers. A commercially-viable distribution of content requires technology to prevent unauthorised access. Encryption tools are powerful, but have a performance cost. Without encryptio... Read More about New Directions in Commercial Secrecy and Encryption Protocols.

Case-based reasoning in course timetabling: an attribute graph approach (2001)
Conference Proceeding
Burke, E., MacCarthy, B. L., Petrovic, S., & Qu, R. (2001). Case-based reasoning in course timetabling: an attribute graph approach.

An earlier Case-based Reasoning (CBR) approach developed by the authors for educational course timetabling problems employed structured cases to represent the complex relationships between courses. Previous solved cases represented by attribute g... Read More about Case-based reasoning in course timetabling: an attribute graph approach.

Navigating a corpus of journal papers using Handles (2001)
Conference Proceeding
Chapman, C., & Brailsford, D. F. (2001). Navigating a corpus of journal papers using Handles. In A. Hubler, P. Linde, & J. Smith (Eds.),

For some years now the Internet and World Wide Web communities have envisaged moving to a next generation of Web technologies by promoting a globally unique, and persistent, identifier for identifying and locating many forms of published objects .... Read More about Navigating a corpus of journal papers using Handles.

Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain (2001)
Conference Proceeding
Dennis, L. A., & Smaill, A. (2001). Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain. In R. J. Boulton, & P. B. Jackson (Eds.),

This paper reports a case study in the use of proof planning in the context of higher order syntax. Rippling is a heuristic for guiding rewriting steps in induction that has been used successfully in proof planning inductive proofs using first order... Read More about Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain.

Vector Graphics: From PostScript and Flash to SVG (2001)
Conference Proceeding
Probets, S., Mong, J., Evans, D., & Brailsford, D. F. (2001). Vector Graphics: From PostScript and Flash to SVG. In E. Munson (Ed.),

The XML-based specification for Scalable Vector Graphics (SVG), sponsored by the World Wide Web consortium, allows for compact and descriptive vector graphics for the Web. SVG s domain of discourse is that of graphic primitives whose optional att... Read More about Vector Graphics: From PostScript and Flash to SVG.