1772 search results - page 136 / 355 » Classifying Problems into Complexity Classes |
188
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the problem of learning a user's ordinal preferences on a multiattribute domain, assuming that her preferences are lexicographic. We introduce a general ...
160
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
188
click to vote
TCS
2010
15 years 4 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
178
click to vote
COCO
2004
Springer
15 years 10 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
224
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...