4313 search results - page 103 / 863 » Using time travel to diagnose computer problems |
126
click to vote
PLDI
2010
ACM
16 years 1 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
169
Voted
AHSWN
2010
15 years 4 months ago
2010
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
176
click to vote
AINA
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper is a contribution to the inception of multiple tokens in solving distributed mutual exclusion problem. The proposed algorithm is based on the token ring approach and al...
130
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
141
click to vote
COMPGEOM
2004
ACM
15 years 10 months ago
2004
ACM
We consider the exact and approximate computational complexity of the multivariate LMS linear regression estimator. The LMS estimator is among the most widely used robust linear s...