We analyze the notion of organizational structure in multiagent systems and explain the precise added value and the effects of such organizational structure on the involved agents...
Davide Grossi, Frank Dignum, Mehdi Dastani, Lamb&e...
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
As a side effect of e-marketing strategy the number of spam e-mails is rocketing, the time and cost needed to deal with spam as well. Spam filtering is one of the most difficult t...
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...