14779 search results - page 354 / 2956 » On Ultrametric Algorithmic Information |
166
click to vote
PPSN
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
139
click to vote
SPIRE
2004
Springer
16 years 3 days ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
184
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is a...
148
Voted
CG
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A one-player, finite, probabilistic game with perfect information can be presented as a bipartite graph. For one-player Can't Stop, the graph is cyclic and the chall...
182
click to vote
DATESO
2008
15 years 8 months ago
2008
Matrix factorization or factor analysis is an important task helpful in the analysis of high dimensional real world data. There are several well known methods and algorithms for fa...