1736 search results - page 39 / 348 » String Extension Learning |
67
Voted
IWANN
2005
Springer
15 years 3 months ago
2005
Springer
The Shortest Common Supersequence problem is a hard combinatorial optimization problem with numerous practical applications. Several evolutionary approaches are proposed for this p...
70
Voted
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We present upper bounds on the time and space complexity of finding the global optimum of additively separable functions, a class of functions that has been studied exten...
69
Voted
ACL
1998
14 years 11 months ago
1998
The problem of transforming a lattice into a non-deterministic finite state automaton is non-trivial. We present a transformation algorithm which tracks, for each node of an autom...
72
Voted
PR
2000
14 years 10 months ago
2000
A genetic algorithm-based clustering technique, called GA-clustering, is proposed in this article. The searching capability of genetic algorithms is exploited in order to search f...
84
Voted
FUIN
2002
14 years 10 months ago
2002
Time-varying codes associate variable length code words to letters being encoded depending on their positions in the input string. These codes have been introduced in [8] as a pro...