1092 search results - page 200 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
101
click to vote
RTSS
1992
IEEE
15 years 3 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
105
click to vote
WS
2006
ACM
15 years 5 months ago
2006
ACM
In this paper, we propose a formal notion of network security for ad hoc networks. We adopt a probabilistic security framework, that is, security is defined by a polynomially bou...
ISAAC
2003
Springer
15 years 4 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
101
click to vote
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
Relational data exchange deals with translating a relational database instance over some source schema into a relational database instance over some target schema, according to a ...
107
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: Sensitivity analysis is an indispensable tool for the analysis of complex systems. In a recent paper, we have introduced a thermodynamically consistent variance-based ...