16666 search results - page 400 / 3334 » Descriptive and Computational Complexity |
151
click to vote
SIGCSE
2009
ACM
16 years 7 months ago
2009
ACM
This special session examines frameworks for the preparation of high school computer science (CS) teachers from the Israeli perspective. Specifically, several Israeli CS teacher p...
227
click to vote
FOCS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
183
click to vote
ICDT
2010
ACM
15 years 11 months ago
2010
ACM
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
147
click to vote
ECSQARU
2009
Springer
16 years 1 months ago
2009
Springer
Many computational problems linked to reasoning under uncertainty can be expressed in terms of computing the marginal(s) of the combination of a collection of (local) valuation fun...
251
click to vote
DSL
2009
15 years 4 months ago
2009
Abstract. Various forms of pervasive computing environments are being deployed in an increasing number of areas including healthcare, home automation, and military. This evolution ...