Sciweavers

76 search results - page 9 / 16
» Consequence analysis theory for alarm analysis
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Foundations of organizational structures in multiagent systems
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...
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Computing the multiplicity structure in solving polynomial systems
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 ...
Barry H. Dayton, Zhonggang Zeng
STOC
2010
ACM
245views Algorithms» more  STOC 2010»
14 years 10 days ago
Weighted Geometric Set Cover via Quasi-Uniform Sampling
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 ...
Kasturi Varadarajan
FLAIRS
2008
13 years 9 months ago
On Using SVM and Kolmogorov Complexity for Spam Filtering
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...
Sihem Belabbes, Gilles Richard
COMPGEOM
2010
ACM
14 years 17 days ago
Adding one edge to planar graphs makes crossing number hard
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 ...
Sergio Cabello, Bojan Mohar