1650 search results - page 274 / 330 » The HOM problem is decidable |
CGF
1999
13 years 7 months ago
1999
Light fields and Lumigraphs are capable of rendering scenes of arbitrary geometrical or illumination complexity in real time. They are thus interesting ways of interacting with bo...
JUCS
2002
13 years 7 months ago
2002
: With any Petri net we associated its CPN language which consists of all sequences of transitions which reach a marking with an empty place whereas all proper prefixes of the sequ...
SAC
2008
ACM
13 years 7 months ago
2008
ACM
Conventional e-mail systems are prone to problems that impact their scalability and dependability. E-mail systems operate following a "push-based" approach: the sender s...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
FUIN
2010
13 years 6 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...