Sciweavers

963 search results - page 72 / 193
» On the decomposition of rational functions
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 8 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
IWANN
2009
Springer
14 years 3 months ago
On the Bond Graphs in the Delaunay-Tetrahedra of the Simplicial Decomposition of Spatial Protein Structures
The examination of straightforwardly definable discrete structures in nucleic acids and proteins turned out to be perhaps the most important development in our present knowledge a...
Rafael Ördög, Vince Grolmusz
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 9 months ago
Discovering additive structure in black box functions
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
Giles Hooker
VISUALIZATION
2005
IEEE
14 years 2 months ago
Dataset Traversal with Motion-Controlled Transfer Functions
In this paper, we describe a methodology and implementation for interactive dataset traversal using motion-controlled transfer functions. Dataset traversal here refers to the proc...
Carlos D. Correa, Deborah Silver
DAC
2008
ACM
14 years 9 months ago
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
Ruei-Rung Lee, Jie-Hong Roland Jiang, Wei-Lun Hung