4255 search results - page 154 / 851 » Cover |
108
click to vote
TPHOL
2003
IEEE
15 years 9 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
189
click to vote
AOSE
2001
Springer
15 years 9 months ago
2001
Springer
This paper presents the MESSAGE/UML agent oriented software engineering methodology and illustrates it on an analysis case study. The methodology covers MAS analysis and design an...
113
click to vote
SCALESPACE
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We propose a new complete method to extract significant description(s) of planar curves according to constant curvature segments. This method is based (i) on a multi-sca...
156
click to vote
CCL
1994
Springer
15 years 8 months ago
1994
Springer
We introduce a modular property of equational proofs, called modularity of normalization, for the union of term rewrite systems with shared symbols. The idea is, that every normali...
117
click to vote
ASPDAC
2004
ACM
15 years 8 months ago
2004
ACM
In the well-known "prisoners' problem", a representative example of steganography, two persons attempt to communicate covertly without alerting the warden. One appr...