7661 search results - page 169 / 1533 » Languages and the Computing Profession |
111
click to vote
COLING
2002
15 years 6 months ago
2002
The relative logical scope of multiple modifiers within NP is often semantically significant. This paper proposes a structurally based method for computing the relative scope of s...
127
click to vote
JSYML
2000
15 years 6 months ago
2000
We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous functionals such that is S1 - S9 computable ov...
292
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
The class of unions of conjunctive queries (UCQ) has been shown to be particularly well-behaved for data exchange; its certain answers can be computed in polynomial time (in terms...
144
click to vote
CP
2005
Springer
16 years 2 hour ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
168
click to vote
SIGCSE
2000
ACM
15 years 10 months ago
2000
ACM
We look at the essential thinking skills students need to learn in the introductory computer science course based on object-oriented programming. We create a framework for such a ...