Sciweavers

114 search results - page 5 / 23
» Reasoning over Networks by Symbolic Methods
Sort
View
IJCAI
2007
13 years 8 months ago
A Fully Connectionist Model Generator for Covered First-Order Logic Programs
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
Sebastian Bader, Pascal Hitzler, Steffen Höll...
VLDB
1995
ACM
181views Database» more  VLDB 1995»
13 years 11 months ago
NeuroRule: A Connectionist Approach to Data Mining
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
Hongjun Lu, Rudy Setiono, Huan Liu
WCNC
2008
IEEE
14 years 1 months ago
Decoding on Graphs: LDPC-Coded MISO Systems and Belief Propagation
— This paper proposes a new approach for decoding LDPC codes over MISO channels. Since in an nT × 1 MISO system with a modulation of alphabet size 2M, nT transmitted symbols are...
Amir H. Djahanshahi, Paul H. Siegel, Laurence B. M...
LICS
1998
IEEE
13 years 11 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
ATAL
2009
Springer
14 years 1 months ago
A self-organizing neural network architecture for intentional planning agents
This paper presents a model of neural network embodiment of intentions and planning mechanisms for autonomous agents. The model bridges the dichotomy of symbolic and non-symbolic ...
Budhitama Subagdja, Ah-Hwee Tan