Sciweavers

3008 search results - page 262 / 602
» Independence in connected graphs
Sort
View
COGSCI
2010
107views more  COGSCI 2010»
15 years 6 months ago
Inferring Hidden Causal Structure
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 ...
Tamar Kushnir, Alison Gopnik, Chris Lucas, Laura S...
PC
2000
100views Management» more  PC 2000»
15 years 6 months ago
Parallel optimisation algorithms for multilevel mesh partitioning
Three parallel optimisation algorithms for use in the context of multilevel graph partitioning for unstructured meshes are described. The first, interface optimisation reduces the...
Chris Walshaw, Mark Cross
IWPC
2010
IEEE
15 years 5 months ago
A Simple and Effective Measure for Complex Low-Level Dependencies
The measure dep-degree is a simple indicator for structural problems and complex dependencies on code-level. We model low-level dependencies between program operations as use-def ...
Dirk Beyer, Ashgan Fararooy
RSA
2010
89views more  RSA 2010»
15 years 5 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
LR
2011
108views more  LR 2011»
14 years 9 months ago
Modeling production networks with discrete processes by means of communities of autonomous units
Abstract Communities of autonomous units are devices for the visual modeling of interactive logistic processes. The framework is founded on rule-based graph transformation and allo...
Hans-Jörg Kreowski, Sabine Kuske, Caroline vo...