Sciweavers

667 search results - page 76 / 134
» Exceptions for Algorithmic Skeletons
Sort
View
FIWAC
1993
139views Cryptology» more  FIWAC 1993»
14 years 25 days ago
Montgomery-Suitable Cryptosystems
Montgomery’s algorithm [8], hereafter denoted Mn(·, ·), is a process for computing Mn(A, B) = ABN mod n where N is a constant factor depending only on n. Usually, AB mod n is o...
David Naccache, David M'Raïhi
CNSR
2004
IEEE
174views Communications» more  CNSR 2004»
14 years 14 days ago
Network Intrusion Detection Using an Improved Competitive Learning Neural Network
This paper presents a novel approach for detecting network intrusions based on a competitive learning neural network. In the paper, the performance of this approach is compared to...
John Zhong Lei, Ali A. Ghorbani
CAV
2000
Springer
125views Hardware» more  CAV 2000»
14 years 11 days ago
Efficient Reachability Analysis of Hierarchical Reactive Machines
Hierarchical state machines is a popular visual formalism for software specifications. To apply automated analysis to such specifications, the traditional approach is to compile th...
Rajeev Alur, Radu Grosu, Michael McDougall
KR
1991
Springer
14 years 7 days ago
Modal Nonmonotonic Logics: Ranges, Characterization, Computation
In the paper, we investigate the way in which nonmonotonic modal logics depend on their underlying monotonic modal logics. Most notably, we study when different monotonic modal l...
V. Wiktor Marek, Grigori F. Shvarts, Miroslaw Trus...
FLAIRS
2008
13 years 11 months ago
On the Compilation of Possibilistic Default Theories
Handling exceptions represents one of the most important problems in Artificial Intelligence. Several approaches have been proposed for reasoning on default theories. This paper f...
Salem Benferhat, Safa Yahi, Habiba Drias