Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Evolving mario levels in the latent space of a deep convolutional generative adversarial network
- Vanessa Volz, Jacob Schrum, Jialin Liu, S. Lucas, Adam M. Smith, S. Risi
- Computer ScienceGECCO
- 2 May 2018
This paper trains a GAN to generate levels for Super Mario Bros using a level from the Video Game Level Corpus, and uses the champion A* agent from the 2009 Mario AI competition to assess whether a level is playable, and how many jumping actions are required to beat it.
Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco
- Dominik Moritz, Chenglong Wang, +4 authors Jeffrey Heer
- Computer Science, MedicineIEEE Transactions on Visualization and Computer…
- 1 January 2019
This work proposes modeling visualization design knowledge as a collection of constraints, in conjunction with a method to learn weights for soft constraints from experimental data, which can take theoretical design knowledge and express it in a concrete, extensible, and testable form.
Answer Set Programming for Procedural Content Generation: A Design Space Approach
- Adam M. Smith, M. Mateas
- Computer ScienceIEEE Transactions on Computational Intelligence…
- 7 June 2011
An approach to content generation that centers on explicit description of the design space, using domain-independent procedures to produce artifacts from the described space by concisely capturing a design space as an answer set program is outlined.
An empirical study of incorporating cost into test suite reduction and prioritization
This paper uses the Harrold Gupta Soffa, delayed greedy, traditional greedy, and 2-optimal greedy algorithms for both test suite reduction and prioritization to greedily reduce and prioritize the tests by using both test cost and the ratio of code coverage to test cost.
Variations Forever: Flexibly generating rulesets from a sculptable design space of mini-games
This paper presents the procedural content generation research which makes the automatic generation of suitable game rulesets possible and exploits answer-set programming as a means to declaratively represent a generative space as distinct from the domain-independent solvers which it uses to enumerate it.
RuleBender: integrated modeling, simulation and visualization for rule-based intracellular biochemistry
- Adam M. Smith, Wen Xu, Yao Sun, J. Faeder, G. Marai
- Computer Science, MedicineBMC Bioinformatics
- 18 May 2012
This work introduces RuleBender, a novel visualization system for the integrated visualization, modeling and simulation of rule-based intracellular biochemistry, with emphasis on visual global/local model exploration and integrated execution of simulations.
WaveFunctionCollapse is constraint solving in the wild
This paper examines WFC as an instance of constraint solving methods, tracing WFC's explosive influence on the technical artist community, explaining its operation in terms of ideas from the constraint solving literature, and probing its strengths by means of a surrogate implementation using answer set programming.
AI-based Game Design Patterns
A generative ideation technique to combine a design pattern with an AI technique or capacity to make newAI-based games is proposed and demonstrated through two examples of AI-based game prototypes created using these patterns.
Personalized Mathematical Word Problem Generation
- Oleksandr Polozov, Eleanor O'Rourke, Adam M. Smith, Luke Zettlemoyer, Sumit Gulwani, Z. Popovic
- Computer ScienceIJCAI
- 25 July 2015
This work proposes a novel technique for automatic generation of personalized word problems that takes a logical encoding of the specification, synthesizes a word problem narrative and its mathematical model as a labeled logical plot graph, and realizes the problem in natural language.
Test suite reduction and prioritization with call trees
- Adam M. Smith, Joshua Geiger, Gregory M. Kapfhammer, M. Soffa
- Computer ScienceASE '07
- 5 November 2007
A tool that constructs tree-based models of a program's behavior during testing and employs these trees while reordering and reducing a test suite and visualizes the call trees and the coverage relationships is presented.