Sciweavers

4457 search results - page 511 / 892
» Tests of Machine Intelligence
Sort
View
ARITH
1993
IEEE
15 years 11 months ago
Faster numerical algorithms via exception handling
An attractive paradigm for building fast numerical algorithms is the following: 1 try a fast but occasionally unstable algorithm, 2 test the accuracy of the computed answer, a...
James Demmel, Xiaoye S. Li
EURODAC
1994
IEEE
110views VHDL» more  EURODAC 1994»
15 years 11 months ago
Symbolic exploration of large circuits with enhanced forward/backward traversals
Symbolic state space exploration techniques for Finite State Machines (FSMs) are a major recent result in CAD for VLSI. Most of them are exact and based on forward traversal, but ...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
ICLP
1992
Springer
15 years 11 months ago
Weighted Decision Trees
: Whiledecision tree compilationis a promisingway tocarry out guard tests e ciently, the methods given in the literature do not take into account either the execution characteristi...
Saumya K. Debray, Sampath Kannan, Mukul Paithane
BICOB
2009
Springer
15 years 10 months ago
Constrained Fisher Scores Derived from Interaction Profile Hidden Markov Models Improve Protein to Protein Interaction Predictio
Protein-protein interaction plays critical roles in cellular functions. In this work, we propose a computational method to predict protein-protein interaction by using support vec...
Alvaro J. González, Li Liao
COMPSYSTECH
2007
15 years 10 months ago
A refinement model with information granulation focused on difficult to distinguish cases
: The paper proposes a different approach to data modeling. Analogous to the rejection method, where the misclassifications are removed and manually evaluated, we focus here on dif...
Plamena Andreeva, Plamen Andreev, Maya Dimitrova, ...