1686 search results - page 56 / 338 » Programs as polygraphs: computability and complexity |
114
click to vote
FOCS
1998
IEEE
15 years 4 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...
ICDT
2010
ACM
15 years 4 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 ...
DEBS
2008
ACM
15 years 1 months ago
2008
ACM
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
202
click to vote
SIGMOD
2005
ACM
16 years 8 hour ago
2005
ACM
: Workflow systems often present the user with rich interfaces that express all the capabilities and complexities of the application programs and the computing environments that th...
104
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...