Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Graph transformation works under a whole-world assumption. In modelling realistic systems, this typically makes for large graphs and sometimes also large, hard to understand rules....
Traditionally, ocean acoustic signals have been acquired using hydrophones, which measure the pressure field and are typically omnidirectional. A vector sensor measures both the ac...
While Enterprise Architecture Modeling (EAM) methodologies become more and more popular, an EAM methodology tailored to the needs of virtual organizations (VO) is still to be devel...