Sciweavers

20 search results - page 2 / 4
» Sets of Boolean Connectives That Make Argumentation Easier
Sort
View
SIAMCOMP
2011
12 years 11 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
TFS
2008
107views more  TFS 2008»
13 years 4 months ago
Towards a General Class of Operators for Fuzzy Systems
Abstract-- Our starting point is the multiplicative utility function which is extensively used in the theory of multicriteria decision making. Its associativity is shown and as its...
József Dombi
CSDA
2008
116views more  CSDA 2008»
13 years 5 months ago
High-dimensional data visualisation: The textile plot
The textile plot is a parallel coordinate plot in which the ordering, locations and scales of the axes are simultaneously chosen so that the connecting lines, each of which repres...
Natsuhiko Kumasaka, Ritei Shibata
SAT
2007
Springer
184views Hardware» more  SAT 2007»
13 years 11 months ago
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
Gilles Audemard, Lakhdar Sais
INFOCOM
2002
IEEE
13 years 9 months ago
Detecting SYN Flooding Attacks
Abstract—We propose a simple and robust mechanism for detecting SYN flooding attacks. Instead of monitoring the ongoing traffic at the front end (like firewall or proxy) or a ...
Haining Wang, Danlu Zhang, Kang G. Shin