DSpace Repository

Mathematics and Computer Science Faculty Research

Mathematics and Computer Science Faculty Research

 

Recent Submissions

  • Anthony, Barbara M.; Reagan, Kathryn (SECEIJ, 2017-07)
    Community-engaged learning is not very common in technical fields, but including relevant projects in courses can make it feasible and successful. We present an implementation of an operations research course at a liberal ...
  • Schrum, Jacob; Karpov, Igor V.; Miikkulainen, Risto (IEEE, 2011)
    The UT^2 bot, which had a humanness rating of 27.2727% in BotPrize 2010, is based on two core ideas: (1) multiobjective neuroevolution is used to learn skilled combat behavior, but filters on the available combat actions ...
  • Schrum, Jacob; Miikkulainen, Risto (2016)
    Many challenging sequential decision-making problems require agents to master multiple tasks. For instance, game agents may need to gather resources, attack opponents, and defend against attacks. Learning algorithms can ...
  • Schrum, Jacob; Miikkulainen, Risto (ACM, 2015)
    Many challenging sequential decision-making problems require agents to master multiple tasks, such as defense and offense in many games. Learning algorithms thus benefit from having separate policies for these tasks, and ...
  • Schrum, Jacob; Miikkulainen, Risto (IEEE, 2012)
    Intelligent opponent behavior makes video games interesting to human players. Evolutionary computation can discover such behavior, however, it is challenging to evolve behavior that consists of multiple separate tasks. ...
  • Schrum, Jacob; Miikkulainen, Risto (IEEE, 2011)
    Intelligent opponent behavior helps make video games interesting to human players. Evolutionary computation can discover such behavior, especially when the game consists of a single task. However, multitask domains, in ...
  • Schrum, Jacob; Miikkulainen, Risto (ACM, 2014)
    Ms. Pac-Man is a challenging video game in which multiple modes of behavior are required to succeed: Ms. Pac-Man must escape ghosts when they are threats, and catch them when they are edible, in addition to eating all pills ...
  • Schrum, Jacob; Miikkulainen, Risto (IEEE, 2009)
    Evolution is often successful in generating complex behaviors, but evolving agents that exhibit distinctly different modes of behavior under different circumstances (multi-modal behavior) is both difficult and time consuming. ...
  • Schrum, Jacob; Miikkulainen, Risto (ACM, 2010)
    Multiobjective evolutionary algorithms have long been applied to engineering problems. Lately they have also been used to evolve behaviors for intelligent agents. In such applications, it is often necessary to "shape" the ...
  • Schrum, Jacob; Miikkulainen, Risto (IEEE, 2016)
    Ms. Pac-Man is a challenging video game in which multiple modes of behavior are required: Ms. Pac-Man must escape ghosts when they are threats and catch them when they are edible, in addition to eating all pills in each ...
  • Schrum, Jacob; Miikkulainen, Risto (2008)
    It is difficult to discover effective behavior for NPCs automatically. For instance, evolutionary methods can learn sophisticated behaviors based on a single objective, but realistic game playing requires different ...
  • Schrum, Jacob; Lehman, Joel; Risi, Sebastian (ACM, 2016)
    An important challenge in neuroevolution is to evolve multimodal behavior. Indirect network encodings can potentially answer this challenge. Yet in practice, indirect encodings do not yield effective multimodal controllers. ...
  • Anthony, Barbara M.; Chung, Christine (Journal of Combinatorial Optimization, 2016-11)
    We consider the online matching problem, where n server-vertices lie in a metric space and n request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. We focus on the ...
  • Anthony, Barbara M.; Chung, Christine (IEEE http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=6831556, 2013)
    Despite only a small portion of unlimited data plan users experiencing throttling each month, it is a prominent source of complaints from users and a significant concern for mobile network operators. We propose a simple ...
  • Anthony, Barbara M.; Chung, Christine (Springer http://link.springer.com/article/10.1007/s10878-012-9581-9, 2012)
    We consider the online bottleneck matching problem, where kk server-vertices lie in a metric space and kk request-vertices that arrive over time each must immediately be permanently assigned to a server-vertex. The ...
  • Anthony, Barbara M.; Picollelli, Michael E. (Springer http://link.springer.com/article/10.1007/s00373-014-1521-2, 2015)
    The domination polynomial of a graph is the polynomial whose coefficients count the number of dominating sets of each cardinality. A recent question asks which graphs are uniquely determined (up to isomorphism) by their ...
  • Richards, Kendall C. (2007)
    This informal working paper provides an expository survey of some inequalities and associated conjectures involving the Gaussian hypergeometric function 2F1 and closely related bivariate means. Recent as well as previously ...
  • Denman, Richard; Foster, Stephen (2008)
    The 1-in-3 SAT problem is known to be NP-complete even in the absence of negated variables [1], a variant known as Positive (or Monotone) 1-in-3 SAT. In this note, we use clausal graphs to investigate a further restriction: ...
  • Anthony, Barbara M.; Denman, Richard (2009)
    The not all equal (NAE) 3-SAT problem is known to be NP-complete even in the absence of negated variables (see [11]), a variant known as positive (or monotone) NAE 3-SAT. In this article, we investigate a related category, ...