This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...
The fastest known algorithms in classical algebra make use of signature functions. That is, reducing computation with formulae to computing with the integers modulo p, by substitut...
The paper presents two new approaches to multiobjective design space exploration for parametric VLSI systems. Both considerably reduce the number of simulations needed to determin...
ome this restriction, we develop so-called loose domains which abstract over several precise domains. Similar to the relation between supertypes and subtypes, we get a relation bet...