451 search results - page 46 / 91 » On Parameterized Exponential Time Complexity |
IRI
2007
IEEE
14 years 4 months ago
2007
IEEE
Suppose we are given a set A of activities of interest, a set O of observations, and a probability threshold p. We are interested in finding the set of all pairs (a, O ), where a...
IANDC
2008
13 years 10 months ago
2008
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
ETFA
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— This article presents some results about schedulability analysis of tasks with offsets also known as transactions, in the particular case of monotonic transactions. The...
CIE
2007
Springer
14 years 4 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
ISSADS
2005
Springer
14 years 3 months ago
2005
Springer
Classical distributed database systems monolithically offer distribution transparency and higher performance. This is made possible by making data available and closer to the appl...