12487 search results - page 2429 / 2498 » Graspable Work Modeling |
130
click to vote
ICDT
2010
ACM
15 years 8 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 ...
171
click to vote
DBPL
1993
Springer
15 years 8 months ago
1993
Springer
In this paper we study the expressive power of query languages for nested bags. We de ne the ambient bag language by generalizing the constructs of the relational language of Brea...
132
click to vote
ASPLOS
1992
ACM
15 years 7 months ago
1992
ACM
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
136
click to vote
CONCUR
1992
Springer
15 years 7 months ago
1992
Springer
Petri Place/Transition (PT) nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the "...
175
click to vote
PODS
1994
ACM
15 years 7 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...