6943 search results - page 272 / 1389 » Representations for evolutionary algorithms |
242
click to vote
NAACL
2010
15 years 2 months ago
2010
This paper proposes a general learning framework for a class of problems that require learning over latent intermediate representations. Many natural language processing (NLP) dec...
150
click to vote
DEXA
2005
Springer
15 years 10 months ago
2005
Springer
The main challenge of mining sequential patterns is the high processing cost of support counting for large amount of candidate patterns. For solving this problem, SPAM algorithm wa...
137
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A fixed-point free involution on a finite set S is defined as a bijection I : S S such as e S, I(I(e)) = e and e S, I(e) = e. In this article, the fixed-point free involutions ...
157
click to vote
ECAI
1992
Springer
15 years 8 months ago
1992
Springer
Abstract. The paper refutes the general phenomenological argument that knowledge cannot be completely represented by symbols and, hence, symbolic AI does not work. Moreover, the vi...
124
Voted
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...