In this paper, we describe an algorithm to compute arbitrary stationary multiple-point formulas. We report its full implementation in Maple and show some examples matching formula...
We present some new classes of numbers that are easier to test for primality with the Elliptic Curve Primality Proving algorithm than average numbers. It is shown that this is the...
The SUPER project presents a novel approach to BPM by using Semantic Web and Semantic Web Services. Existing processes can be augmented with semantic annotations, so that formal re...
Marin Dimitrov, Alex Simov, Sebastian Stein, Mihai...
This is an experience report on the architectural reengineering of a large software portfolio. In order to minimize the risks of such an undertaking, companies tend to be conserva...
The aim of this paper is to present a simple yet efficient implementation of a tool for simultaneous rule-based morphosyntactic tagging and partial parsing formalism. The parser ...