159 search results - page 21 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
We study a family of graph clustering problems where each cluster has to satisfy a certain local requirement. Formally, let µ be a function on the subsets of vertices of a graph G...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
FCT
1999
Springer
13 years 11 months ago
1999
Springer
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the promise class UP. We propose an analogous new method—weaker in strength of evidence ...
CCECE
2009
IEEE
14 years 2 months ago
2009
IEEE
A complex system is expected to show different nominal behaviors under different conditions, and the deviation over time from these nominal behaviors is an indicator of potential ...
EMSOFT
2007
Springer
14 years 1 months ago
2007
Springer
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...