15 citations · 23 across the 6 of their papers we have counts for
6 papers
Batch Matrix-form Equations and Implementation of Multilayer Perceptrons
Wieger Wesselink, Bram Grooten, Huub van de Wetering +2
Multilayer perceptrons (MLPs) remain fundamental to modern deep learning, yet their algorithmic details are rarely presented in complete, explicit \emph{batch matrix-form}. Rather,…
Formal Verification of Minimax Algorithms
Wieger Wesselink, Kees Huizing, Huub van de Wetering
Minimax-based search algorithms with alpha-beta pruning and transposition tables are a central component of classical game-playing engines and remain widely used in practice. Despi…
Nerva: a Truly Sparse Implementation of Neural Networks
Wieger Wesselink, Bram Grooten, Qiao Xiao +2
We introduce Nerva, a fast neural network library under development in C++. It supports sparsity by using the sparse matrix operations of Intel's Math Kernel Library (MKL), which e…
On-The-Fly Solving for Symbolic Parity Games
Maurice Laveaux, Wieger Wesselink, Tim A. C. Willemse
Parity games can be used to represent many different kinds of decision problems. In practice, tools that use parity games often rely on a specification in a higher-order logic from…
A Comparison of BDD-Based Parity Game Solvers
Lisette Sanchez, Wieger Wesselink, Tim A. C. Willemse
Parity games are two player games with omega-winning conditions, played on finite graphs. Such games play an important role in verification, satisfiability and synthesis. It is the…
Improved Static Analysis of Parameterised Boolean Equation Systems using Control Flow Reconstruction
Jeroen J. A. Keiren, Wieger Wesselink, Tim A. C. Willemse
We present a sound static analysis technique for fighting the combinatorial explosion of parameterised Boolean equation systems (PBESs). These essentially are systems of mutually r…