Sciweavers

1712 search results - page 186 / 343
» A Computational Approach to Binding Theory
Sort
View
104
Voted
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
15 years 7 months ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
93
Voted
FOSSACS
2006
Springer
15 years 5 months ago
Distributed Unfolding of Petri Nets
Some recent Petri net-based approaches to fault diagnosis of distributed systems suggest to factor the problem into local diagnoses based on the unfoldings of local views of the sy...
Paolo Baldan, Stefan Haar, Barbara König
123
Voted
ICLP
2010
Springer
15 years 5 months ago
Inductive Logic Programming as Abductive Search
We present a novel approach to non-monotonic ILP and its implementation called tal (Top-directed Abductive Learning). tal overcomes some of the completeness problems of ILP systems...
Domenico Corapi, Alessandra Russo, Emil Lupu
AAAI
2010
15 years 3 months ago
Reinforcement Learning via AIXI Approximation
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian...
Joel Veness, Kee Siong Ng, Marcus Hutter, David Si...
GECCO
2008
Springer
152views Optimization» more  GECCO 2008»
15 years 3 months ago
Designing EDAs by using the elitist convergent EDA concept and the boltzmann distribution
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...
Sergio Ivvan Valdez Peña, Arturo Hern&aacut...