741 search results - page 129 / 149 » A Note on the Use of Independent Sets for the k-SAT Problem |
CCS
2005
ACM
14 years 1 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
ESAW
2004
Springer
14 years 28 days ago
2004
Springer
In this paper we present analysis and calibration techniques that exploit knowledge about a multi agent society in order to calibrate the system parameters of a corresponding socie...
FOSSACS
2001
Springer
14 years 17 hour ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...