Damien Anderson
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Damien Anderson has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Lee Clift
University of Strathclyde, Glasgow, United Kingdom
6 shared publications John Levine
Computer and Information Sciences, University of Strathclyde, Glasgow, United Kingdom
4 shared publications- Catriona Weir
University of Strathclyde, Glasgow, United Kingdom
2 shared publications Diego Perez-Liebana
School of Electronic Engineering and Computer Science, Queen Mary University of London, London, United Kingdom
2 shared publicationsJochen Renz
Australian National University
2 shared publications- John Levine
Computer and Information Science Department University of Strathclyde Glasgow UK
2 shared publications
Latest Publications
- Open Access
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 626
"Trì, Dhà, a H-Aon!": Incorporating Incidental Minority Language Usage Into Computing Lessons
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 626
Open Access"Trì, Dhà, a H-Aon!": Incorporating Incidental Minority Language Usage Into Computing Lessons
- Open Access
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 736-738
Essential Computing Capabilities: Identifying Foundational Underpinnings for Computing Curricula
- 11 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 736-738
Open AccessEssential Computing Capabilities: Identifying Foundational Underpinnings for Computing Curricula
- Open Access
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 819-820
QueryPRIMM: A PRIMM-Based Tool for Learning SQL
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 819-820
Open AccessQueryPRIMM: A PRIMM-Based Tool for Learning SQL
- Open Access
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 837-838
Embedding External Partner Code Reviews into Mobile Application Development Coursework
- 9 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 837-838
Open AccessEmbedding External Partner Code Reviews into Mobile Application Development Coursework
- Open Access
- 21 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 124
Planly: Teaching AI Planning Through Block-Based Programming and Robotics
- 21 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 124
Open AccessPlanly: Teaching AI Planning Through Block-Based Programming and Robotics
- Open Access
- 3 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1
Enhancing Degree Apprentice Engagement in Hybrid Programmes through Interactive Videos
- 3 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1
Open AccessEnhancing Degree Apprentice Engagement in Hybrid Programmes through Interactive Videos
- Open Access
- 3 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1
Enhancing Student Engagement through a Gamified Feedback Loop in Computer Science
- 3 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1
Open AccessEnhancing Student Engagement through a Gamified Feedback Loop in Computer Science
- Open Access
A Continuous Information Gain Measure to Find the Most Discriminatory Problems for AI Benchmarking
This paper introduces an information-theoretic method for selecting a subset of problems which gives the most information about a group of problem-solving algorithms. This method was tested on the games in the General Video Game AI (GVGAI) framework, allowing us to identify a smaller set of games that still gives a large amount of information about the abilities of different game-playing agents. This approach can be used to make agent testing more efficient. We can achieve almost as good discriminatory accuracy when testing on only a handful of games as when testing on more than a hundred games, something which is often computationally infeasible. Furthermore, this method can be extended to study the dimensions of the effective variance in game design between these games, allowing us to identify which games differentiate between agents in the most complementary ways.
Open AccessA Continuous Information Gain Measure to Find the Most Discriminatory Problems for AI Benchmarking
This paper introduces an information-theoretic method for selecting a subset of problems which gives the most information about a group of problem-solving algorithms. This method was tested on the games in the General Video Game AI (GVGAI) framework, allowing us to identify a smaller set of games that still gives a large amount of information about the abilities of different game-playing agents. This approach can be used to make agent testing more efficient. We can achieve almost as good discriminatory accuracy when testing on only a handful of games as when testing on more than a hundred games, something which is often computationally infeasible. Furthermore, this method can be extended to study the dimensions of the effective variance in game design between these games, allowing us to identify which games differentiate between agents in the most complementary ways.
- 1 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Ensemble Decision Systems for General Video Game Playing
Ensemble Decision Systems offer a unique form of decision making that allows a collection of algorithms to reason together about a problem. Each individual algorithm has its own inherent strengths and weaknesses, and often it is difficult to overcome the weaknesses, while retaining the strengths. Instead of altering the properties of the algorithm, the Ensemble Decision System augments the performance with other algorithms that have complementing strengths. This work outlines different options for building an Ensemble Decision System as well as providing analysis on its performance compared to the individual components of the system with interesting results, showing an increase in the generality of the algorithms without significantly impeding performance.
- 1 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Ensemble Decision Systems for General Video Game Playing
Ensemble Decision Systems offer a unique form of decision making that allows a collection of algorithms to reason together about a problem. Each individual algorithm has its own inherent strengths and weaknesses, and often it is difficult to overcome the weaknesses, while retaining the strengths. Instead of altering the properties of the algorithm, the Ensemble Decision System augments the performance with other algorithms that have complementing strengths. This work outlines different options for building an Ensemble Decision System as well as providing analysis on its performance compared to the individual components of the system with interesting results, showing an increase in the generality of the algorithms without significantly impeding performance.
- Open Access
Ensemble Decision Systems for General Video Game Playing
Ensemble Decision Systems offer a unique form of decision making that allows a collection of algorithms to reason together about a problem. Each individual algorithm has its own inherent strengths and weaknesses, and often it is difficult to overcome the weaknesses while retaining the strengths. Instead of altering the properties of the algorithm, the Ensemble Decision System augments the performance with other algorithms that have complementing strengths. This work outlines different options for building an Ensemble Decision System as well as providing analysis on its performance compared to the individual components of the system with interesting results, showing an increase in the generality of the algorithms without significantly impeding performance.
Open AccessEnsemble Decision Systems for General Video Game Playing
Ensemble Decision Systems offer a unique form of decision making that allows a collection of algorithms to reason together about a problem. Each individual algorithm has its own inherent strengths and weaknesses, and often it is difficult to overcome the weaknesses while retaining the strengths. Instead of altering the properties of the algorithm, the Ensemble Decision System augments the performance with other algorithms that have complementing strengths. This work outlines different options for building an Ensemble Decision System as well as providing analysis on its performance compared to the individual components of the system with interesting results, showing an increase in the generality of the algorithms without significantly impeding performance.