976 search results - page 65 / 196 » The Complexity of Timetable Construction Problems |
IPSN
2009
Springer
14 years 3 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
STACS
2009
Springer
14 years 3 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
ICDCS
1998
IEEE
14 years 1 months ago
1998
IEEE
Exceptions are one of the most pervasive problems in process support systems. In installations expected to handle a large number of processes, having exceptions is bound to be a n...
SOFSEM
2009
Springer
14 years 6 months ago
2009
Springer
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
WOLLIC
2009
Springer
14 years 3 months ago
2009
Springer
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...