147 search results - page 1 / 30 » Counting as integration in feasible analysis |
MLQ
2006
13 years 10 months ago
2006
JUCS
2008
13 years 10 months ago
2008
: Taking as a starting point (a modification of) a weak theory of arithmetic of Jan Johannsen and Chris Pollett (connected with the hierarchy of counting functions), we introduce s...
ESA
2008
Springer
14 years 19 days ago
2008
Springer
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and > 0, correctly de...
STOC
2005
ACM
14 years 11 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
CASES
2011
ACM
12 years 11 months ago
2011
ACM
This paper advocates a rigorously formal and compositional style for obtaining key performance and/or interface metrics of systems with real-time constraints. We propose a hierarc...