Outputs (39)

Comparing hybrid constructive heuristics for university course timetabling (2011)
Presentation / Conference Contribution
Landa-Silva, D., & Obit, J. H. (2011). Comparing hybrid constructive heuristics for university course timetabling.

This extended abstract outlines four hybrid heuristics to generate initial solutions to the University course timetabling problem. These hybrid approaches combine graph colouring heuristics and local search in different ways. Results of experiments u... Read More about Comparing hybrid constructive heuristics for university course timetabling.

Designing difficult office space allocation problem instances with mathematical programming (2011)
Presentation / Conference Contribution
Ulker, O., & Landa-Silva, D. (2011). Designing difficult office space allocation problem instances with mathematical programming.

Office space allocation (OSA) refers to the assignment of room space to a set of entities (people, machines, roles, etc.), with the goal of optimising the space utilisation while satisfying a set of additional constraints. In this paper, a mathematic... Read More about Designing difficult office space allocation problem instances with mathematical programming.

Into the wild: challenges and opportunities for field trial methods (2011)
Presentation / Conference Contribution
Brown, B., Reeves, S., & Sherwood, S. (2011). Into the wild: challenges and opportunities for field trial methods.

Field trials of experimental systems `in the wild' have developed into a standard method within HCI - testing new systems with groups of users in relatively unconstrained settings outside of the laboratory. In this paper we discuss methodological cha... Read More about Into the wild: challenges and opportunities for field trial methods.

A heuristic algorithm for nurse scheduling with balanced preference satisfaction (2011)
Presentation / Conference Contribution
Constantino, A. A., Landa-Silva, D., Luiz de Melo, E., & Romao, W. (2011). A heuristic algorithm for nurse scheduling with balanced preference satisfaction.

This paper tackles the nurse scheduling problem with balanced preference satisfaction which consists of generating an assignment of shifts to nurses over a given time horizon and ensuring that the satisfaction of nurses personal preferences for shift... Read More about A heuristic algorithm for nurse scheduling with balanced preference satisfaction.

On Euclid’s algorithm and elementary number theory (2011)
Journal Article
Backhouse, R., & Ferreira, J. F. (2011). On Euclid’s algorithm and elementary number theory. Science of Computer Programming, 76(3), https://doi.org/10.1016/j.scico.2010.05.006

Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid’s algorithm. We illustrate how to use the alg... Read More about On Euclid’s algorithm and elementary number theory.

Fast and robust appearance-based tracking (2011)
Presentation / Conference Contribution
Liwicki, S., Zafeiriou, S., Tzimiropoulos, G., & Pantic, M. (2011). Fast and robust appearance-based tracking.

We introduce a fast and robust subspace-based approach to appearance-based object tracking. The core of our approach is based on Fast Robust Correlation (FRC), a recently proposed technique for the robust estimation of large translational displacemen... Read More about Fast and robust appearance-based tracking.

Principal component analysis of image gradient orientations for face recognition (2011)
Presentation / Conference Contribution
Tzimiropoulos, G., Zafeiriou, S., & Pantic, M. (2011). Principal component analysis of image gradient orientations for face recognition.

We introduce the notion of Principal Component Analysis (PCA) of image gradient orientations. As image data is typically noisy, but noise is substantially different from Gaussian, traditional PCA of pixel intensities very often fails to estimate reli... Read More about Principal component analysis of image gradient orientations for face recognition.

Motif detection inspired by immune memory (2011)
Journal Article
Wilson, W., Birkin, P., & Aickelin, U. (2011). Motif detection inspired by immune memory. Journal of the Operational Research Society, 62, https://doi.org/10.1057/jors.2010.81

The search for patterns or motifs in data represents an area
of key interest to many researchers. In this paper we present the Motif Tracking Algorithm, a novel immune inspired pattern identification tool that is able to identify variable length unk... Read More about Motif detection inspired by immune memory.

Congestion aware forwarding in delay tolerant and social opportunistic networks (2011)
Presentation / Conference Contribution
Radenkovic, M., & Grundy, A. (2011). Congestion aware forwarding in delay tolerant and social opportunistic networks. In 2011 Eighth International Conference on Wireless On-Demand Network Systems and Services. https://doi.org/10.1109/WONS.2011.5720201

We propose an approach for opportunistic forwarding that supports optimization of multipoint high volume data flow transfer while maintaining high buffer availability and low delays. This paper explores a number of social, buffer and delay heuristics... Read More about Congestion aware forwarding in delay tolerant and social opportunistic networks.

Subspace analysis of arbitrarily many linear filter responses with an application to face tracking (2011)
Presentation / Conference Contribution
Zafeiriou, S., Tzimiropoulos, G., & Pantic, M. (2011). Subspace analysis of arbitrarily many linear filter responses with an application to face tracking.

Multi-scale/orientation local image analysis methods are valuable tools for obtaining highly distinctive image-based representations. Very often, these features are generated from the responses of a bank of linear filters corresponding to different s... Read More about Subspace analysis of arbitrarily many linear filter responses with an application to face tracking.