Results 241 to 250 of about 914,936 (268)
Some of the next articles are maybe not open access.
Complexity, Networks and Knowledge Flows
Academy of Management Proceedings, 2002Because knowledge plays an important role in the creation of wealth, economic actors often wish to skew the flow of knowledge in their favor. We ask, when will an actor socially close to the source of some knowledge have the greatest advantage over distant actors in receiving and building on the knowledge?
Olav Sorenson +2 more
openaire +1 more source
Packet Flow on Telecommunication Networks
SIAM Journal on Mathematical Analysis, 2006The aim of this paper is to introduce a macroscopic fluid dynamic model dealing with the flow of information on a telecommunication network encoded in packets. Taking an intermediate time and space scale, we propose a model similar to that introduced recently for car traffic; see [G. M. Coclite, M. Garavello, and B. Piccoli, SIAM J. Math.
D'APICE, Ciro +2 more
openaire +3 more sources
Management Science, 1970
The concept of maximising present value is applied to the timing of activities in a network. The mathematical form of the problem is that of maximising a nonlinear function subject to linear constraints and can be solved as a succession of linear programmes.
openaire +1 more source
The concept of maximising present value is applied to the timing of activities in a network. The mathematical form of the problem is that of maximising a nonlinear function subject to linear constraints and can be solved as a succession of linear programmes.
openaire +1 more source
Operations Research, 1963
A network is a set of nodes Nı connected by arcs with nonnegative arc capacities bıj which indicates the maximum amount of flow that can pass through the arc from Nı to Nj. Given all bıj, there is a maximum flow from Nı to Nj using all arcs. Under the assumption that bıj = bjı, the present paper generalizes the max-flow min-cut theorem of Ford and ...
openaire +1 more source
A network is a set of nodes Nı connected by arcs with nonnegative arc capacities bıj which indicates the maximum amount of flow that can pass through the arc from Nı to Nj. Given all bıj, there is a maximum flow from Nı to Nj using all arcs. Under the assumption that bıj = bjı, the present paper generalizes the max-flow min-cut theorem of Ford and ...
openaire +1 more source
1987
Abstract : The author studied conditions in which a point process of certain jump timers of a Markov process is a Poisson process; a multi-administration telecommunications network; and a system in which customers arrive singly or in batches of a group of service stations. Keywords: Stochastic processes; Optimal control; Queueing theory.
openaire +1 more source
Abstract : The author studied conditions in which a point process of certain jump timers of a Markov process is a Poisson process; a multi-administration telecommunications network; and a system in which customers arrive singly or in batches of a group of service stations. Keywords: Stochastic processes; Optimal control; Queueing theory.
openaire +1 more source
Confirming Information Flows in Networks [PDF]
, 2011 Social networks, be it on the internet or in real life, facilitate information flows. We model this by giving agents incentives to link with others and receive information through those links. In many networks agents will value confirmation of the information they receive from others.
Billand, Pascal +3 more
openaire +6 more sources