25 search results - page 5 / 5 » Inferring Lower Bounds for Runtime Complexity |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The width of a resolution proof is the maximal number of literals in any clause of the proof. The space of a proof is the maximal number of clauses kept in memory simultaneously if...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
Dynamic real-time systems require adaptive resource management to accommodate varying processing needs. We address the problem of resource management with multiple shared resource...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
ICPADS
1994
IEEE
13 years 9 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
EUROSYS
2007
ACM
14 years 1 months ago
2007
ACM
Most implementations of critical Internet protocols are written in type-unsafe languages such as C or C++ and are regularly vulnerable to serious security and reliability problems...