Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
Abstract. The aim of this paper is to gradually introduce formalism in the requirement engineering phase in order to facilitate its validation. We analyze and elicit our requiremen...
We consider the numerical computation of stationary distributions for level dependent quasi-birth-and-death processes. An algorithm based on matrix continued fractions is presente...
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is su...
Touch is an important but poorly studied aspect of emotional communication. With the Haptic Creature we are investigating fundamentals of affective touch. This small robot senses t...