707 search results - page 82 / 142 » The Nonhomomorphicity of Boolean Functions |
ICANN
2007
Springer
14 years 2 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
ETFA
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract. In this paper, reverse partially-marked safe net condition/event systems (RsNCES) are introduced, rules of their functioning are defined and convenient interpretation met...
FLOPS
2004
Springer
14 years 1 months ago
2004
Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
ICDT
2003
ACM
14 years 1 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
IJCAI
1993
13 years 9 months ago
1993
The Dempster-Shafer theory gives a solid basis for reasoning applications characterized by uncertainty. A key feature of the theory is that propositions are represented as subsets...