4372 search results - page 266 / 875 » Algorithmic Theories of Everything |
159
click to vote
DIS
2008
Springer
15 years 7 months ago
2008
Springer
Frequent closures (FCIs) and generators (FGs) as well as the precedence relation on FCIs are key components in the definition of a variety of association rule bases. Although their...
172
click to vote
AAAI
2004
15 years 7 months ago
2004
We develop an exact dynamic programming algorithm for partially observable stochastic games (POSGs). The algorithm is a synthesis of dynamic programming for partially observable M...
142
click to vote
ESANN
2004
15 years 7 months ago
2004
This paper presents some interesting results obtained by the algorithm by Bauer, Der and Hermann (BDH) [1] for magnification control in Self-Organizing Maps. Magnification control ...
179
click to vote
NIPS
2001
15 years 7 months ago
2001
We consider the problem of learning to attain multiple goals in a dynamic environment, which is initially unknown. In addition, the environment may contain arbitrarily varying ele...
159
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
This paper presents a theoretical definition for designing EDAs called Elitist Convergent Estimation of Distribution Algorithm (ECEDA), and a practical implementation: the Boltzm...