Sciweavers

9842 search results - page 1887 / 1969
» Problem complexity
Sort
View
CCS
2005
ACM
14 years 4 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
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...
Santiago Escobar, Catherine Meadows, José M...
CHARME
2005
Springer
94views Hardware» more  CHARME 2005»
14 years 4 months ago
Verifying Quantitative Properties Using Bound Functions
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
Arindam Chakrabarti, Krishnendu Chatterjee, Thomas...
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
14 years 4 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
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...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
ECWEB
2005
Springer
136views ECommerce» more  ECWEB 2005»
14 years 4 months ago
Music Rights Clearance Business Analysis and Delivery
Abstract. Semantic Web Services can be seen as remote Problem Solving Methods offered via the Web through platform and language independent interfaces. They can be seamlessly inte...
Carlos Pedrinaci, Ziv Baida, Hans Akkermans, Amaia...
MICAI
2005
Springer
14 years 4 months ago
Agent-Based Simulation Replication: A Model Driven Architecture Approach
In Multi-agent based simulation (MABS) systems, computational models are built as multi-agent systems (MAS). Replication of these models can contribute to improve the reliability o...
Candelaria Sansores, Juan Pavón
« Prev « First page 1887 / 1969 Last » Next »