2181 search results - page 67 / 437 » The restriction scaffold problem |
TEI
2012
ACM
12 years 4 months ago
2012
ACM
Most current mobile technologies require on-screen operations for interacting with devices’ visual contents. However, as a trade-off for mobility, screens usually provide limite...
CPM
2006
Springer
14 years 14 days 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...
DAM
2002
13 years 8 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 ...
SIAMDM
1998
13 years 8 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...
MP
2002
13 years 8 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...