#### Filter Results:

- Full text PDF available (99)

#### Publication Year

1992

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Brit Hopmann, Luuk Groenewegen, +10 authors Ofer Shir
- 2000

VERHUIZINGEN: De eerste verhuizingen zijn achter de rug. De volgende personen zijn inmiddels verhuisd:

- 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)

- 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)

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)

- J Eggermont, G Sprinkhuizen-Kuyper, W A Kosters
- 1998

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)

- 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)