Abstract. We identify a network of sequential processes that communicate by synchronizing frequently on common actions. More precisely, we demand that there is a bound k such that ...
Abstract In order to extend the modeling capabilities of rewriting systems, it is rather natural to consider that the firing of rules can be subject to some probabilistic laws. Co...
We propose an enhanced mechanism for selecting partners for multi-attribute negotiation. The mechanism employs possibilistic case-based reasoning. The possibility of successful ne...
The paper describes the architecture of Brown University’s agent, Botticelli, a finalist in the 2003 Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM,...
Michael Benisch, Amy R. Greenwald, Ioanna Grypari,...
This paper addresses the problem of the explanation of the result given by a decision tree, when it is used to predict the class of new cases. In order to evaluate this result, the...