Ross Mawhorter

Orcid: 0000-0002-4735-010X

According to our database1, Ross Mawhorter authored at least 15 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Comprehensive and Instantly Responsive Player Assistance using Binary Decision Diagrams.
Proceedings of the 19th International Conference on the Foundations of Digital Games, 2024

Ahead-of-time Compilation for Diverse Samplers of Constrained Design Spaces.
Proceedings of the 19th International Conference on the Foundations of Digital Games, 2024

2023
xenoGI 3: using the DTLOR model to reconstruct the evolution of gene families in clades of microbes.
BMC Bioinform., December, 2023

Automated Testing in Super Metroid with Abstraction-Guided Exploration.
Proceedings of the 18th International Conference on the Foundations of Digital Games, 2023

2022
The Randomizer Community does Procedural Content Generation Research.
Proceedings of the FDG '22: Proceedings of the 17th International Conference on the Foundations of Digital Games, 2022

Searching for Balanced 2D Brawler Games: Successes and Failures of Automated Evaluation.
Proceedings of the Eighteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2022

2021
Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Maximum parsimony reconciliation in the DTLOR model.
BMC Bioinform., 2021

eMPRess: a systematic cophylogeny reconciliation tool.
Bioinform., 2021

Softlock Detection for Super Metroid with Computation Tree Logic.
Proceedings of the FDG'21: The 16th International Conference on the Foundations of Digital Games 2021, 2021

Neurosymbolic Map Generation with VQ-VAE and WFC.
Proceedings of the FDG'21: The 16th International Conference on the Foundations of Digital Games 2021, 2021

Content Reinjection for Super Metroid.
Proceedings of the Seventeenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 2021

2019
An efficient exact algorithm for computing all pairwise distances between reconciliations in the duplication-transfer-loss model.
BMC Bioinform., 2019

Inferring Pareto-optimal reconciliations across multiple event costs under the duplication-loss-coalescence model.
BMC Bioinform., 2019

Hierarchical clustering of maximum parsimony reconciliations.
BMC Bioinform., 2019


  Loading...