19866 search results - page 259 / 3974 » Computing all factorizations in *** |
152
click to vote
ICLP
1990
Springer
15 years 10 months ago
1990
Springer
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
194
click to vote
SIGGRAPH
1992
ACM
15 years 10 months ago
1992
ACM
We define the antiumbra and the antipenumbra of a convex area light source shining through a sequence of convex areal holes in three dimensions. The antiumbra is the volume from w...
183
click to vote
ANTS
2008
Springer
15 years 8 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
150
click to vote
AMC
2007
15 years 6 months ago
2007
In this contribution instances of a problem introduced by the differential cryptanalysis of Feistel cryptosystems are formulated as optimization tasks. The performance of Evoluti...
149
click to vote
IDEAS
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper, we introduce a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a...