412 search results - page 14 / 83 » A New Proof of the F5 Algorithm |
DAGM
2004
Springer
15 years 1 months ago
2004
Springer
The well-known and very simple MinOver algorithm is reformulated for incremental support vector classification with and without kernels. A modified proof for its O(t-1/2 ) converge...
ANSS
1991
IEEE
15 years 1 months ago
1991
IEEE
This paper first summerizes and then presents a formal proof to a new conservative deadlock-free algorithm, YADDES [l], for asynchronous discrete event simulation. The proof not o...
AIIA
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
We present FixIt(ALC), a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL) ALC. FixIt(ALC) does not search for tree-structured m...
179
click to vote
WEA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit – as measured ...