A large and reliable DNA codeword library is key to the success of DNA based computing. Searching for sets of reliable DNA codewords is an NP-hard problem, which can take days on ...
Qinru Qiu, Daniel J. Burns, Prakash Mukre, Qing Wu
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
We consider the problem of simplifying a triangle mesh using edge contractions, under the restriction that the resulting vertices must be a subset of the input set. That is, contr...
Mattias Andersson, Joachim Gudmundsson, Christos L...
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...