Learn More
The game of Tetris. In the popular computer game of Tetris, we are given an initial m-by-n game-board, which is a partially filled rectangular grid. The player is given, one by one, a sequence of p tetromi-noes; see Figure 1. Each piece begins in the middle Figure 1: The tetrominoes Sq (" square "), LG (" left gun "), RG (" right gun "), LS (" left snake(More)
In this paper we present a novel approach to determine the exact diameter (longest shortest path length) of large graphs, in particular of the nowadays frequently studied small world networks. Typical examples include social networks, gene networks, web graphs and internet topology networks. Due to complexity issues, the diameter is often calculated based(More)
When Genetic Programming is used to evolve decision trees for data classification, search spaces tend to become extremely large. We present several methods using techniques from the field of machine learning to refine and thereby reduce the search space sizes for decision tree evolvers. We will show that these refinement methods improve the classification(More)
In this master's thesis we compare and combine learning algorithms for two different architectures. The rst is the standard Multi-layered Feed-forward Network , the second is the BP-SOM architecture. The BP-SOM architecture combines a Multi-layered Feed-forward Network with one or more Self-Organizing Maps. The second part of this Master's Thesis looks at(More)
MOTIVATION Pattern discovery in protein sequences is often based on multiple sequence alignments (MSA). The procedure can be computationally intensive and often requires manual adjustment, which may be particularly difficult for a set of deviating sequences. In contrast, two algorithms, PRATT2 (http//www.ebi.ac.uk/pratt/) and TEIRESIAS(More)