Sciweavers

208 search results - page 22 / 42
» Arithmetic Operations in the Polynomial Modular Number Syste...
Sort
View
CADE
2005
Springer
14 years 8 months ago
An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
FUIN
2008
177views more  FUIN 2008»
13 years 7 months ago
A Multi-facet Approach to Dynamic Agent Systems
We are concerned with the problem of defining a complex, hybrid, agent based discrete system in a modular way. The modularity results from looking at the system from a number of di...
Marek A. Bednarczyk, Wieslaw Pawlowski, Luca Berna...
CPM
1995
Springer
139views Combinatorics» more  CPM 1995»
13 years 11 months ago
Pattern-Matching for Strings with Short Descriptions
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
Marek Karpinski, Wojciech Rytter, Ayumi Shinohara
KBSE
2007
IEEE
14 years 1 months ago
Adaptation hiding modularity
Growth in the complexity of computing systems, in the dynamism of the environments they operate in, and the need for timely adaptations as conditions change, now pose significant...
Yuanyuan Song
ARITH
2005
IEEE
14 years 1 months ago
Fast Modular Reduction for Large Wordlengths via One Linear and One Cyclic Convolution
Abstract— Modular reduction is a fundamental operation in cryptographic systems. Most well known modular reduction methods including Barrett’s and Montgomery’s algorithms lev...
Dhananjay S. Phatak, Tom Goff