6562 search results - page 130 / 1313 » Noetherianity and Combination Problems |
157
click to vote
NDSS
1999
IEEE
15 years 9 months ago
1999
IEEE
Suppose that messages have been signed using a user's signature private key during the period of time after a key compromise but before the compromise is detected. This is a ...
146
click to vote
CPE
1998
Springer
15 years 9 months ago
1998
Springer
We present a new dynamic probabilistic state exploration algorithm based on hash compaction. Our method has a low state omission probability and low memory usage that is independen...
185
click to vote
EURODAC
1995
IEEE
15 years 8 months ago
1995
IEEE
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
119
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Agents programmed in BDI-inspired languages have goals to achieve and a library of plans that can be used to achieve them, typically requiring further goals to be adopted. This is...
127
click to vote
FLAIRS
2003
15 years 6 months ago
2003
Current rule base maintenance is wasting refinement and inference performance. There are only few maintenance concepts, which enjoy both (1) formal rule refinement and (2) utili...