803 search results - page 76 / 161 » Independence in Direct-Product Graphs |
137
click to vote
APN
2007
Springer
15 years 7 months ago
2007
Springer
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
101
click to vote
MFCS
1997
Springer
15 years 4 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
122
Voted
PLDI
1993
ACM
15 years 4 months ago
1993
ACM
Program analysis and optimizationcan be speeded upthrough the use of the dependence flow graph (DFG), a representation of program dependences which generalizes def-use chains and...
104
click to vote
COGSCI
2010
15 years 26 days ago
2010
We used a new method to assess how people can infer unobserved causal structure from patterns of observed events. Participants were taught to draw causal graphs, and then shown a ...
94
Voted
PC
2000
15 years 16 days ago
2000
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...