1794 search results - page 265 / 359 » Visualizing Memory Graphs |
124
click to vote
PSTV
1993
15 years 3 months ago
1993
We present a new algorithm that can be used for solving the model−checking problem for linear−time temporal logic. This algorithm can be viewed as the combination of two exist...
110
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
140
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
The domain of numerical simulation is a place where the parallelization of numerical code is common. The definition of a numerical context means the configuration of resources suc...
108
click to vote
CI
1998
15 years 2 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
119
click to vote
ICPP
2009
IEEE
15 years 1 days ago
2009
IEEE
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...