861 search results - page 93 / 173 » Polymorphic Time Systems for Estimating Program Complexity |
ASPLOS
2011
ACM
13 years 18 days ago
2011
ACM
This paper presents S2E, a platform for analyzing the properties and behavior of software systems. We demonstrate S2E’s use in developing practical tools for comprehensive perfo...
IMC
2003
ACM
14 years 2 months ago
2003
ACM
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimate of the network distance between ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Tree-based protocols are ubiquitous in distributed systems. They are flexible, they perform generally well, and, in static conditions, their analysis is mostly simple. Under churn...
VLDB
2001
ACM
14 years 1 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
ICASSP
2010
IEEE
13 years 9 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...