1650 search results - page 280 / 330 » The HOM problem is decidable |
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
CIKM
2009
Springer
14 years 11 days ago
2009
Springer
Answering queries using views is a well-established technique in databases. In this context, two outstanding problems can be formulated. The first one consists in deciding whethe...
FOCS
2004
IEEE
13 years 11 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider qualitative and quantitative verification problems for infinite-state Markov chains. We call a Markov chain decisive w.r.t. a given set of target states F if it almos...
IPL
2010
13 years 6 months ago
2010
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...