2150 search results - page 58 / 430 » On a restricted cross-intersection problem |
104
click to vote
PPSN
2004
Springer
15 years 5 months ago
2004
Springer
In spite of the recent quick growth of the Evolutionary Multi-objective Optimization (EMO) research field, there has been few trials to adapt the general variation operators to t...
ECCC
2006
14 years 12 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
118
click to vote
CPM
2006
Springer
15 years 3 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...
102
click to vote
DAM
2002
14 years 11 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
108
click to vote
SIAMDM
1998
14 years 11 months ago
1998
For every string inclusion relation there are two optimization problems: find a longest string included in every string of a given finite language, and find a shortest string in...