Search Results for author: Andy M. Connor

Found 6 papers, 0 papers with code

Minimum cost polygon overlay with rectangular shape stock panels

no code implementations19 Jun 2016 Wilson S. Siringoringo, Andy M. Connor, Nick Clements, Nick Alexander

Minimum Cost Polygon Overlay (MCPO) is a unique two-dimensional optimization problem that involves the task of covering a polygon shaped area with a series of rectangular shaped panels.

A comparison of semi-deterministic and stochastic search techniques

no code implementations18 May 2016 Andy M. Connor, Kristina Shea

This paper presents an investigation of two search techniques, tabu search (TS) and simulated annealing (SA), to assess their relative merits when applied to engineering design optimisation.

Resource allocation using metaheuristic search

no code implementations6 May 2016 Andy M. Connor, Amit Shah

The main aim of this research is to evaluate the performance of different metaheuristic search techniques in resource allocation and scheduling problems that would be typical of software development projects.

Management Scheduling

Multi-agent evolutionary systems for the generation of complex virtual worlds

no code implementations20 Apr 2016 Jan Kruse, Andy M. Connor

Modern films, games and virtual reality applications are dependent on convincing computer graphics.

Procedural urban environments for FPS games

no code implementations20 Apr 2016 Jan Kruse, Ricardo Sosa, Andy M. Connor

A computational agent is trained using machine learning techniques to capture the intent of the game designer as part of the multi-agent system, and to enable a semi-automated aesthetic selection for the underlying genetic algorithm.

BIG-bench Machine Learning FPS Games

Efficient optimisation of structures using tabu search

no code implementations29 Oct 2014 Andy M. Connor, Keith A. Seffen, Geoffrey T. Parks, P. John Clarkson

This paper presents a novel approach to the optimisation of structures using a Tabu search (TS) method.

Cannot find the paper you are looking for? You can Submit a new open access paper.