6943 search results - page 582 / 1389 » Representations for evolutionary algorithms |
222
click to vote
CPM
2006
Springer
15 years 11 months ago
2006
Springer
For two strings a, b, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In a previous paper, we defined a generalisat...
211
click to vote
EUROGP
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
175
click to vote
AAECC
2007
Springer
15 years 7 months ago
2007
Springer
We present an approximate implicitization method for planar curves. The computed implicit representation is a piecewise rational approximation of the distance function to the given...
186
click to vote
IJAR
2007
15 years 7 months ago
2007
Possibilistic networks are important tools for dealing with uncertain pieces of information. For multiplyconnected networks, it is well known that the inference process is a hard ...
205
click to vote
ACTA
2000
15 years 7 months ago
2000
We show in this paper that parsing with regular expressions instead of context-free grammars, when it is possible, is desirable. We present efficient algorithms for performing diff...