422 search results - page 25 / 85 » On combinations of CMA equalizers |
IGPL
2002
14 years 9 months ago
2002
Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of...
101
click to vote
RC
2007
14 years 9 months ago
2007
The search algorithm presented allows the CDF of a dependent variable to be bounded with 100%confidence,andallowsforaguaranteedevaluationof theerror involved.Thesereliabilitybound...
FUIN
2010
14 years 7 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
AMOST
2005
ACM
15 years 3 months ago
2005
ACM
The combinatorial approach to software testing uses models to generate a minimal number of test inputs so that selected combinations of input values are covered. The most common c...
103
click to vote
AISC
2004
Springer
15 years 3 months ago
2004
Springer
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...