29 search results - page 1 / 6 » Closing the Gap Between Runtime Complexity and Polytime Comp... |
RTA
2010
Springer
13 years 9 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
FLOPS
2010
Springer
14 years 1 days ago
2010
Springer
Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In this paper we show ...
GI
2009
Springer
13 years 3 months ago
2009
Springer
: Frequently, Security Monitoring is equated with network intrusion detection. However, Security Monitoring has a much broader scope. It also comprises detection of insider attacks...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
CCGRID
2004
IEEE
13 years 9 months ago
2004
IEEE
The next generation Grid will demand the Grid middleware to provide flexibility, transparency, and reliability. This implies the appliance of service level agreements to guarantee...