Sciweavers

8824 search results - page 79 / 1765
» On the Complexity of Real Functions
Sort
View
CDES
2008
87views Hardware» more  CDES 2008»
15 years 5 months ago
Finding Minimal ESCT Expressions for Boolean Functions with Weight of up to 7
In this paper an algorithm is proposed for the synthesis and exact minimization of ESCT (Exclusive or Sum of Complex Terms) expressions for Boolean functions of up to seven comple...
Dimitrios Voudouris, Marinos Sampson, George K. Pa...
VAMOS
2009
Springer
15 years 10 months ago
Functional Variant Modeling for Adaptable Functional Networks
The application of functional networks in the automotive industry is still very slowly adopted into their development processes. Reasons for this are manifold. A functional networ...
Cem Mengi, Ibrahim Armaç
ISMVL
1997
IEEE
134views Hardware» more  ISMVL 1997»
15 years 8 months ago
Functional Decomposition of MVL Functions Using Multi-Valued Decision Diagrams
In this paper, the minimization of incompletely specified multi-valued functions using functional decomposition is discussed. From the aspect of machine learning, learning sample...
Craig M. Files, Rolf Drechsler, Marek A. Perkowski
DMTCS
2003
89views Mathematics» more  DMTCS 2003»
15 years 5 months ago
On the Monotonic Computability of Semi-computable Real Numbers
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...
Xizhong Zheng, George Barmpalias
110
Voted
BMCBI
2010
105views more  BMCBI 2010»
15 years 4 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang