976 search results - page 134 / 196 » The Complexity of Timetable Construction Problems |
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
DLOG
2008
13 years 11 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
JAIR
2008
13 years 9 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
IPSN
2007
Springer
14 years 3 months ago
2007
Springer
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...