1650 search results - page 66 / 330 » The HOM problem is decidable |
166
click to vote
IPL
2010
15 years 4 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...
156
click to vote
PDCAT
2005
Springer
15 years 11 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...
146
click to vote
ISSAC
2004
Springer
15 years 11 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...
175
click to vote
JUCS
2010
15 years 26 days 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...
155
click to vote
CSCLP
2007
Springer
16 years 8 days 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...