9842 search results - page 351 / 1969 » The Complexity of the Matching-Cut Problem |
134
click to vote
TAMC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
128
click to vote
COCOON
2009
Springer
15 years 10 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...
126
click to vote
PODS
2006
ACM
16 years 4 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
134
Voted
CP
2004
Springer
15 years 9 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
142
click to vote
CP
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...