16404 search results - page 636 / 3281 » A set coverage problem |
200
click to vote
IAT
2005
IEEE
16 years 23 days ago
2005
IEEE
Whenever independent, non-cooperative actors jointly have to solve a complex task, they need to coordinate their efforts. Typical examples of such task coordination problems are s...
221
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...
183
click to vote
DAM
2002
15 years 6 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 ...
169
click to vote
EUSFLAT
2001
15 years 8 months ago
2001
In this paper we will describe several methods that solve, using mathematical programming, different problems that, although can be used in others fields in the fuzzy modelling co...
186
click to vote
FC
2005
Springer
16 years 21 days ago
2005
Springer
Two parties, say Alice and Bob, possess two sets of elements that belong to a universe of possible values and wish to test whether these sets are disjoint or not. In this paper we ...