Skip to main content

Research Repository

See what's under the surface


Creating reusable well-structured pdf as a sequence of component object graphic (cog) elements (2003)
Conference Proceeding
Bagley, S. R., Brailsford, D. F., & Hardy, M. R. B. (2003). Creating reusable well-structured pdf as a sequence of component object graphic (cog) elements. In C. Roisin, C. Vanoirbeek, & E. Munson (Eds.),

Portable Document Format (PDF) is a page-oriented, graphically rich format based on PostScript semantics and it is also the format interpreted by the Adobe Acrobat viewers. Although each of the pages in a PDF document is an independent graphic objec... Read More

Similarity Measures for Exam Timetabling Problems (2003)
Conference Proceeding
Burke, E., Eckersley, A., McCollum, B., Petrovic, S., & Qu, R. (2003). Similarity Measures for Exam Timetabling Problems

A large number of heuristic algorithms have been developed over the years which have been aimed at solving examination timetabling problems. However, many of these algorithms have been developed specifically to solve one particular problem instance o... Read More

Rippling in PVS (2003)
Conference Proceeding
Adams, A. A., & Dennis, L. A. (2003). Rippling in PVS. In B. Di Vito, M. Archer, & C. Munoz (Eds.),

Rippling is a method of controlling rewriting of the terms in an induction step of an inductive proof, to ensure that a position is reached whereby the induction hypothesis can be applied. Rippling was developed primarily by the Mathematical Reasoni... Read More

'A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem' (2003)
Conference Proceeding
Li, J., & Aickelin, U. (2003). 'A Bayesian Optimisation Algorithm for the Nurse Scheduling Problem'

Abstract- A Bayesian optimization algorithm for the nurse scheduling problem is presented, which involves choosing a suitable scheduling rule from a set for each nurse's assignment. Unlike our previous work that used GAs to implement implicit learnin... Read More

'Explicit Learning: an Effort towards Human Scheduling Algorithms' (2003)
Conference Proceeding
Li, J., & Aickelin, U. (2003). 'Explicit Learning: an Effort towards Human Scheduling Algorithms'

Abstract Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approaches are problem-specific and research into the development o... Read More

A Bayesian optimization algorithm for the nurse scheduling problem (2003)
Conference Proceeding
Li, J., & Aickelin, U. (2003). A Bayesian optimization algorithm for the nurse scheduling problem

A Bayesian optimization algorithm for the nurse scheduling problem is presented, which involves choosing a suitable scheduling rule from a set for each nurse’s assignment. Unlike our previous work that used GAs to implement implicit learning, the lea... Read More

Using SVG as the Rendering Model for Structured and Graphically Complex Web Material (2003)
Conference Proceeding
Mong, J., & Brailsford, D. F. (2003). Using SVG as the Rendering Model for Structured and Graphically Complex Web Material. In C. Roisin, C. Vanoirbeek, & E. Munson (Eds.),

This paper reports some experiments in using SVG (Scalable Vector Graphics), rather than the browser default of (X)HTML/CSS, as a potential Web-based rendering technology, in an attempt to create an approach that integrates the structural and display... Read More