1650 search results - page 260 / 330 » The HOM problem is decidable |
135
click to vote
CSL
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
149
click to vote
ER
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The notion of user preference in database modeling has recently received much attention in advanced applications, such as personalization of e-services, since it captures...
121
click to vote
COCO
1995
Springer
15 years 7 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
139
click to vote
HPCA
1995
IEEE
15 years 7 months ago
1995
IEEE
Information on the behavior of programs is essential for deciding the number and nature of functional units in high performance architectures. In this paper, we present studies on...
118
click to vote
ICDT
1995
ACM
15 years 7 months ago
1995
ACM
A tuple t1 of relation R subsumes tuple t2 of R, with respect to a query Q if for every database, tuple t1 derives all, and possibly more, answers to query Q than derived by tuple ...