In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
In this paper an optimization based model order reduction (MOR) framework is proposed. The method involves setting up a quasiconvex program that explicitly minimizes a relaxation ...
This paper presents a method to reduce time complexity of the computation of higher–order tensor lines. The method can be applied to higher–order tensors and the spherical harm...
Mario Hlawitschka, Gerik Scheuermann, Alfred Anwan...
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
In this paper, we present a method for constructing Loop’s subdivision surface patches with given G1 boundary conditions and a given topology of control polygon of the subdivisi...