4095 search results - page 256 / 819 » How to test a tree |
104
click to vote
FLAIRS
2006
15 years 2 months ago
2006
The inherent vagueness and ambiguity of non-monotonic reasoning makes it impossible to formulate detailed specifications to validate KBS performance by using traditional test-case...
108
Voted
ACL
2012
13 years 3 months ago
2012
We present a novel approach to the task of word lemmatisation. We formalise lemmatisation as a category tagging task, by describing how a word-to-lemma transformation rule can be ...
111
click to vote
OOPSLA
2005
Springer
15 years 6 months ago
2005
Springer
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performanc...
VLSID
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper a new technique for partial product reduction based on the use of look-up tables for efficient processing is presented. We describe how to construct counter devices ...
94
Voted
ICFP
2007
ACM
16 years 18 days ago
2007
ACM
We present a pair of reasoning principles, definition and proof by rigid induction, which can be seen as proper generalizations of lazy-datatype induction to monadic effects other...