Results 231 to 240 of about 157,967 (267)
Some of the next articles are maybe not open access.
Evolutionary dynamics on graphs
Nature, 2005Evolutionary dynamics have been traditionally studied in the context of homogeneous or spatially extended populations. Here we generalize population structure by arranging individuals on a graph. Each vertex represents an individual. The weighted edges denote reproductive rates which govern how often individuals place offspring into adjacent vertices ...
Erez, Lieberman +2 more
openaire +2 more sources
1999
In parallel and distributed computing scheduling low level tasks on the available hardware is a fundamental problem. Traditionally, one has assumed that the set of tasks to be executed is known beforehand. Then the scheduling constraints are given by a precedence graph. Nodes represent the elementary tasks and edges the dependencies among tasks.
Andreas Jakoby +2 more
openaire +1 more source
In parallel and distributed computing scheduling low level tasks on the available hardware is a fundamental problem. Traditionally, one has assumed that the set of tasks to be executed is known beforehand. Then the scheduling constraints are given by a precedence graph. Nodes represent the elementary tasks and edges the dependencies among tasks.
Andreas Jakoby +2 more
openaire +1 more source
Scalable dynamic graph summarization
2016 IEEE International Conference on Big Data (Big Data), 2016Large-scale dynamic graphs can be challenging to process and store, due to their size and the continuous change of communication patterns between nodes. In this work we address the problem of summarizing large-scale dynamic graphs, maintaining the evolution of their structure and the communication patterns.
Ioanna Tsalouchidou +3 more
openaire +1 more source
On the dynamics of sharing graphs
1997We provide a characterization of fan annihilation rules of Lamping's optimal algorithm through suitable paths on the initial graphs of the evaluation. This allows to recast the computational complexity issues of the algorithm in terms of statics. The fruitfulness of the path characterization is pointed out by proving the relationship between the ...
Andrea Asperti, Cosimo Laneve
openaire +1 more source
2013
Much of the work to date on dataflow models for signal processing system design has focused on decidable dataflow models that are best suited for one-dimensional signal processing. This chapter reviews more general dataflow modeling techniques that are targeted to applications that include multidimensional signal processing and dynamic dataflow ...
Bhattacharyya, S.S. +2 more
openaire +2 more sources
Much of the work to date on dataflow models for signal processing system design has focused on decidable dataflow models that are best suited for one-dimensional signal processing. This chapter reviews more general dataflow modeling techniques that are targeted to applications that include multidimensional signal processing and dynamic dataflow ...
Bhattacharyya, S.S. +2 more
openaire +2 more sources
A Dynamic location problem for graphs
Combinatorica, 1989zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan R. K. Chung +2 more
openaire +1 more source
Self-Organizing Dynamic Graphs
Neural Processing Letters, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ezequiel López-Rubio +2 more
openaire +1 more source
Laplacian Dynamics on General Graphs
Bulletin of Mathematical Biology, 2013In previous work, we have introduced a "linear framework" for time-scale separation in biochemical systems, which is based on a labelled, directed graph, G, and an associated linear differential equation, dx/dt = L(G) ∙ x, where L(G) is the Laplacian matrix of G. Biochemical nonlinearity is encoded in the graph labels. Many central results in molecular
Mirzaev, Inomzhon, Gunawardena, Jeremy
openaire +2 more sources
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H. BAUMANN +2 more
openaire +4 more sources
Journal of Systems and Software, 2006
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trace contains only those operations that relate to a particular object. Traces can be very large for longer system executions.
Jochen Quante, Rainer Koschke
openaire +1 more source
A trace is a record of the execution of a computer program, showing the sequence of operations executed. A trace may be obtained through static or dynamic analysis. An object trace contains only those operations that relate to a particular object. Traces can be very large for longer system executions.
Jochen Quante, Rainer Koschke
openaire +1 more source