9842 search results - page 1947 / 1969 » The Complexity of the Matching-Cut Problem |
202
Voted
WOWMOM
2005
ACM
16 years 1 months ago
2005
ACM
— This paper presents the ALCA (Asymmetric Link Collision Avoidance) protocol. ALCA was designed to deal with a known deficiency of the Basic Scheme [1] for power control in 802...
221
Voted
ATAL
2005
Springer
16 years 29 days ago
2005
Springer
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
218
Voted
CCS
2005
ACM
16 years 29 days 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...
188
click to vote
CHARME
2005
Springer
16 years 29 days ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
199
Voted
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
16 years 29 days ago
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...