This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Mi...
We present in this paper an extension of the messagedriven confidence-driven framework that we developed for onboard guarded software upgrading. The purpose of this work is to pr...
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...
In this paper we present a new matching method called Tuple Matching (TM), which is an algorithm for matching of signatures. Since signatures can contain arbitrary features like c...
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...