882 search results - page 142 / 177 » On the Hardness of Graph Isomorphism |
189
click to vote
SRDS
1993
IEEE
15 years 10 months ago
1993
IEEE
We propose a simple and practical probabilistic comparison-based model, employing multiple incomplete test concepts, for handling fault location in distributed systems using a Bay...
139
click to vote
EUROSYS
2010
ACM
15 years 10 months ago
2010
ACM
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
202
click to vote
FSTTCS
1993
Springer
15 years 10 months ago
1993
Springer
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the se...
168
click to vote
EUROPAR
2007
Springer
15 years 9 months ago
2007
Springer
To understand the principles of information processing in the brain, we depend on models with more than 105 neurons and 109 connections. These networks can be described as graphs o...
149
click to vote
EMSOFT
2006
Springer
15 years 9 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...