We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
In this work we propose a general approach for representing uncertainty measures in the framework of t-norm based logics. This approach is extended also to classes of measures lik...
In this paper we formalise compilation of the conjunctive bodies of a restricted class of Horn rules into updates on terminologies. This involves a pre-processing of the graphs re...
In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class o...
This is a very nice article that explains the Documentum Foundation Class and how it relates to .NET programming. I developed a lot of applications using .NET that work with Docume...