We present a characterization of supercompactness measures for ω1 in L(R), and of countable products of such measures, using inner models. We give two applications of this charact...
In this work we give a state-of-the-art review of two of the most established classes of fuzzy implications, viz., (S, N)- and R-implications. Firstly, we discuss their properties...
Abstract. We reformulate a known characterization of decomposability of polytopes in a way which may be more computationally convenient, and offer a more transparent proof. We appl...
The angle defect, which is the standard way to measure the curvatures at the vertices of polyhedral surfaces, goes back at least as far as Descartes. Although the angle defect has ...
The paper presents an algebraic characterization of observability and span-reachability of bilinear hybrid systems without guards, i.e. hybrid systems whose continuous dynamics is...
We present a characterization of a useful class of skills based on a graphical representation of an agent's interaction with its environment. Our characterization uses betwee...
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
A reversible automaton is a finite (possibly incomplete) automaton in which each letter induces a partial one-to-one map from the set of states into itself. We give four non-trivi...
The choice of the selection method used in an evolutionary algorithm may have considerable impacts on the behavior of the entire algorithm. Therefore, earlier work was devoted to t...
This paper argues that the existing approaches to modeling and characterization of IC malfunctions are inadequate for test and yield learning of Deep Sub-Micron (DSM) products. Tr...
Wojciech Maly, Anne E. Gattiker, Thomas Zanon, Tho...