6943 search results - page 759 / 1389 » Representations for evolutionary algorithms |
210
click to vote
CORR
2012
Springer
14 years 3 months ago
2012
Springer
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
222
click to vote
CADE
2012
Springer
13 years 9 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
202
Voted
JCST
2008
15 years 7 months ago
2008
This paper presents some new algorithms to efficiently mine max frequent generalized itemsets (g-itemsets) and essential generalized association rules (g-rules). These are compact ...
235
Voted
KCAP
2011
ACM
14 years 10 months ago
2011
ACM
Some supervised-learning algorithms can make effective use of domain knowledge in addition to the input-output pairs commonly used in machine learning. However, formulating this a...
206
click to vote
ICRA
2005
IEEE
16 years 26 days ago
2005
IEEE
— Recently, the acquisition of three-dimensional maps has become more and more popular. This is motivated by the fact that robots act in the three-dimensional world and several t...