We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Abstract: Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equation...
Parallel application development is a very difficult task for non-expert programmers, and therefore support tools are needed for all phases of this kind of application development...
Significant progress in control design has been achieved by the use of nonsmooth and semiinfinite mathematical programming techniques. In contrast with LMI or BMI approaches, thes...
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...