5718 search results - page 1022 / 1144 » Modeling Rule Precision |
154
click to vote
GFKL
2006
Springer
15 years 10 months ago
2006
Springer
Stemming algorithms find canonical forms for inflected words, e. g. for declined nouns or conjugated verbs. Since such a unification of words with respect to gender, number, time, ...
180
click to vote
AINA
2003
IEEE
15 years 10 months ago
2003
IEEE
Condition Data Flow Diagrams (CDFDs) are a formalized notation resulting from the integration of Yourdon Data Flow Diagrams, Petri Nets, and pre-post notation. They are used in th...
154
click to vote
CL
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We propose an extension of concurrent constraint programming with primitives for process migration within a hierarchical network, and we study its semantics. To this purp...
165
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
189
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...