Results 1 to 10 of about 70 (69)
Computation in Complex Networks [PDF]
The Special Issue on “Computation in Complex Networks” focused on gathering highly original papers in the field of current complex network research [...]
Pizzuti C, Socievole A
openaire +6 more sources
Computing in Social Networks [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrei Giurgiu +3 more
openaire +3 more sources
LateX, 77 pages,23 figures; to appear in Annals of ...
MARZUOLI, ANNALISA, Rasetti Mario
openaire +3 more sources
Is the network capable of computation? [PDF]
Ensuring correct network behavior is hard. Previous state of the art has demonstrated that analyzing a network containing middleboxes is hard. In this paper, we show that even using only statically configured switches, and asking the simplest possible question – “Will this concrete packet reach the destination?” – can make the problem intractable ...
Peter Peresíni, Dejan Kostic
openaire +4 more sources
Genetic regulatory networks have the complex task of controlling all aspects of life. Using a model of gene expression by piecewise linear differential equations we show that this process can be considered as a process of computation. This is demonstrated by showing that this model can simulate memory bounded Turing machines.
Asa Ben-Hur, Hava T. Siegelmann
openaire +5 more sources
Disassortativity of computer networks [PDF]
Network data is ubiquitous in cyber-security applications. Accurately modelling such data allows discovery of anomalous edges, subgraphs or paths, and is key to many signature-free cyber-security analytics. We present a recurring property of graphs originating from cyber-security applications, often considered a ‘corner case’ in the main literature on ...
Patrick Rubin-Delanchy +2 more
openaire +2 more sources
Reliability in Computer Networks [PDF]
We use a mathematical model of an open queueing network in heavy traffic. The probability limit theorem for the virtual waiting time of a customer in heavy traffic in open queueing networks has been presented. Finally, we present an application of the theorem - a reliability model from computer network practice.
Saulius Minkevicius, Genadijus Kulvietis
openaire +1 more source
The complexity of computations by networks
Summary: We survey the current state of knowledge concerning the computation of Boolean functions by networks, with particular emphasis on the addition and multiplication of binary numbers.
openaire +3 more sources
Computability of analog networks
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John V. Tucker, Jeffery I. Zucker
openaire +3 more sources

