We present a new type of Markov Chain algo rithm for the calculation of combined Dempster Shafer belief which is almost linear in the size of the frame thus making the calculation of belief feasible for a wider range of problems We also indicate how these algorithms may be used in the cal culation of belief in product spaces associated with networks

This paper describes the defect coverage evaluation of memory testing algorithms. Realistic CMOS defects were extracted from a 2 2 SRAM layout using an IFA tool, and circuit simulations were performed to measure the defect coverages of the eleven memory testing algo-

In September 2006, the Second International Workshop on Parameterized and Exact Computation was held in Zürich, Switzerland, as part of ALGO 2006. At the end of IWPEC 2006, a problem session was held. (Most of) the problems mentioned at this problem session, and some other problems, contributed by the participants of IWPEC 2006 are listed here.

In this paper an algorithm for the calculation of the root locus of fractional linear systems is presented. The proposed algo rithm takes advantage of present day computational resources and processes directly the characteristic equation, avoiding the limitations revealed by standard methods. The results demonstrate the good performance for different types of expressions.

In September 2006, the Second International Workshop on Parameterized and Exact Computation was held in Zürich, Switzerland, as part of ALGO 2006. At the end of IWPEC 2006, a problem session was held. (Most of) the problems mentioned at this problem session, and some other problems, contributed by the participants of IWPEC 2006 are listed here.