All known structures involving a constructively obtainable fixed point (or iteration) operation satisfy the equational laws defining iteration theories. Hence, there seems to be...
Software applications can be described as compositions are components at an abstract level. In this paper we present a component modeling process which allows to design, model and...
Gernot Schmoelzer, Egon Teiniker, Stefan Mitterdor...
The next generation of online reference works will require structured representations of their contents in order to support scholarly functions such as semantic search, automated ...
Versus the customary preconditioners, our weakly random ones are generated more readily and for a much larger class of input matrices. Furthermore our preconditioners have a wider...
Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys...
The classes of languages which are boolean combinations of languages of the form A a1A a2A . . . A a A , where a1, . . . , a A, k , for a fixed k 0, form a natural hierarchy wit...