1650 search results - page 66 / 330 » The HOM problem is decidable |
IPL
2010
13 years 8 months ago
2010
We deal with the problem of deciding whether a given set of string patterns implies the presence of a fixed pattern. While checking whether a set of patterns occurs in a string i...
PDCAT
2005
Springer
14 years 3 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
ISSAC
2004
Springer
14 years 3 months ago
2004
Springer
We present a streamlined and refined version of Karr’s summation algorithm. Karr’s original approach constructively decides the telescoping problem in ΠΣ-fields, a very ge...
JUCS
2010
13 years 4 months ago
2010
: We initiate in this work the study of a sort of redundancy problem revealed by what we call redundant relations. Roughly, we define a redundant relation in a database instance (d...
CSCLP
2007
Springer
14 years 4 months ago
2007
Springer
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alte...