Sciweavers

85 search results - page 5 / 17
» On Polynomial Representations of Boolean Functions Related t...
Sort
View
TCS
1998
13 years 7 months ago
Axiomatisation of Functional Dependencies in Incomplete Relations
Incomplete relations are relations which contain null values, whose meaning is \value is at present unknown". Such relations give rise to two types of functional dependency (...
Mark Levene, George Loizou
GECCO
2009
Springer
14 years 2 months ago
On the scalability of XCS(F)
Many successful applications have proven the potential of Learning Classifier Systems and the XCS classifier system in particular in datamining, reinforcement learning, and func...
Patrick O. Stalph, Martin V. Butz, David E. Goldbe...
TNN
1998
254views more  TNN 1998»
13 years 7 months ago
Periodic symmetric functions, serial addition, and multiplication with neural networks
Abstract—This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable perio...
Sorin Cotofana, Stamatis Vassiliadis
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
14 years 1 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
IACR
2011
104views more  IACR 2011»
12 years 7 months ago
Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
Protocols for generic secure multi-party computation (MPC) come in two forms: they either represent the function being computed as a boolean circuit, or as an arithmetic circuit o...
Seung Geol Choi, Kyung-Wook Hwang, Jonathan Katz, ...