2687 search results - page 367 / 538 » Formal Analysis of PKCS |
187
click to vote
AADEBUG
2000
Springer
15 years 11 months ago
2000
Springer
This work is devoted to constraint solving motivated by the debugging of constraint logic programs a la GNU-Prolog. The paper focuses only on the constraints. In this framework, c...
149
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them su...
141
click to vote
HICSS
1999
IEEE
15 years 10 months ago
1999
IEEE
What EDI needs is a good semantics, that is, a workable formal theory of what EDI messages mean. As is widely recognized, the point applies to electronic commerce and to communica...
162
click to vote
ISCAS
1999
IEEE
15 years 10 months ago
1999
IEEE
To provide a better understanding of physical design algorithms and the underlying circuit architecture they are targeting, we need to exercise the algorithms and architectures wi...
154
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...