1228 search results - page 67 / 246 » Continuations, proofs and tests |
146
click to vote
ECIS
2011
14 years 5 months ago
2011
Post adoption behaviours of e-service users are important for e-service providers to increase both their revenues and profits. This paper develops a model to investigate the facto...
166
click to vote
RANDOM
1997
Springer
15 years 10 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
147
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
145
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
187
click to vote
HYBRID
1998
Springer
15 years 10 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...