Exploiting Interactivity, Influence, Space and Time to Explore Non-linear Drama in Virtual Worlds
(2001)
Conference Proceeding
All Outputs (13)
Comparision of the DNA binding properties of the E2 proteins from a high-risk and a low-risk HPV (2001)
Conference Proceeding
Hybrid population-based metaheuristic approaches for the space allocation problem (2001)
Conference Proceeding
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
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?.
Vector Graphics: From PostScript and Flash to SVG (2001)
Conference Proceeding
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.
Is Experts' Knowledge Modular? (2001)
Conference Proceeding
This paper explores, both with empirical data and with computer simulations, the extent to which modularity characterises experts' knowledge. We discuss a replication of Chase and Simon's (1973) classic method of identifying 'chunks', i.e., perceptua... Read More about Is Experts' Knowledge Modular?.
Ordinal Arithmetic: A Case Study for Rippling in a Higher Order Domain (2001)
Conference Proceeding
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.
Navigating a corpus of journal papers using Handles (2001)
Conference Proceeding
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.
Case-based reasoning in course timetabling: an attribute graph approach (2001)
Conference Proceeding
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.
New Directions in Commercial Secrecy and Encryption Protocols (2001)
Conference Proceeding
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.
Representations of first order function types as terminal coalgebras (2001)
Conference Proceeding
A Pyramidal Genetic Algorithm for Multiple-Choice Problems (2001)
Conference Proceeding
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.
A pyramidal evolutionary algorithm with different inter-agent partnering strategies for scheduling problems (2001)
Conference Proceeding
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.