This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
— Granular computing unifies structured thinking, structured problem solving and structured information processing. In order to see the flexibility and universal applicability ...
A new algorithm for computing contact forces between solid objects with friction is presented. The algorithm allows a mix of contact points with static and dynamic friction. In co...
: In this paper we explore the possibilities to perform the search for results of non-deterministic computations in parallel. We present three different approaches to this problem:...