Sciweavers

6142 search results - page 503 / 1229
» The Complexity of Partition Functions
Sort
View
NIPS
1992
15 years 8 months ago
Network Structuring and Training Using Rule-Based Knowledge
We demonstrate in this paper how certain forms of rule-based knowledge can be used to prestructure a neural network of normalized basis functions and give a probabilistic interpre...
Volker Tresp, Jürgen Hollatz, Subutai Ahmad
WCE
2007
15 years 8 months ago
Cost Effective Implementation of Asynchronous Two-Level Logic
- We proposed the cost effective (in sense of gate number) asynchronous two-level logic. It is based on AND-OR implementation of minimized logic functions. We formulated and proved...
Igor Lemberski
ANOR
2010
119views more  ANOR 2010»
15 years 7 months ago
Optimisation of maintenance scheduling strategies on the grid
Abstract-- The emerging paradigm of Grid Computing provides a powerful platform for the optimisation of complex computer models, such as those used to simulate real-world logistics...
Alex Shenfield, Peter J. Fleming, Visakan Kadirkam...
CORR
2008
Springer
111views Education» more  CORR 2008»
15 years 7 months ago
On the decomposition of k-valued rational relations
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
Jacques Sakarovitch, Rodrigo de Souza
CAGD
2006
90views more  CAGD 2006»
15 years 7 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini