#### Filter Results:

- Full text PDF available (96)

#### Publication Year

1992

2016

- This year (0)
- Last 5 years (15)
- Last 10 years (61)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Ron Breukelaar, Erik D. Demaine, Susan Hohenberger, Hendrik Jan Hoogeboom, Walter A. Kosters, David Liben-Nowell
- Int. J. Comput. Geometry Appl.
- 2003

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)

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)

- Frank W. Takes, Walter A. Kosters
- CIKM
- 2011

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)

- Walter A. Kosters, Wim Pijls, Viara Popova
- MLDM
- 2003

A framework is brieey introduced, which supports the comparison of Neural Networks and Evolutionary Algorithms. This framework, called \Adaptive Sampling", was used for the design of two incomplete 3-SAT methods. The rst one is based on the Neural Network approach, and the second method mixes general features of Neural Networks and Evolutionary Algorithms… (More)

- Walter A. Kosters, Wim Pijls
- FIMI
- 2003

We will discuss DF, the depth £rst implementation of APRIORI as devised in 1999 (see [8]). Given a database, this algorithm builds a trie in memory that contains all frequent itemsets, i.e., all sets that are contained in at least minsup transactions from the original database. Here min-sup is a threshold value given in advance. In the trie, that is… (More)

- Kai Ye, Walter A. Kosters, Adriaan P. IJzerman
- Bioinformatics
- 2007

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)

We introduce a new solving method for SameGame puzzles based on Monte-Carlo simulation, that improves the previous best known method. We also cover the chessboard variant, a subclass of the SameGame puzzle for which we can exactly define which puzzles are solvable and which ones are not. Next to this we present a quantitative approach to classify the… (More)

- Kees Joost Batenburg, Walter A. Kosters
- Pattern Recognition
- 2009

Nonograms, also known as Japanese puzzles, are a specific type of logic drawing puzzles. The challenge is to fill a grid with black and white pixels in such a way that a given description for each row and column, indicating the lengths of consecutive segments of black pixels, is adhered to. Although the Nonograms in puzzle books can usually be solved by… (More)