Results 271 to 280 of about 8,372,639 (310)
Some of the next articles are maybe not open access.
Operations Research Letters, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ariel Orda, Raphael Rom
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ariel Orda, Raphael Rom
openaire +2 more sources
ACM SIGCOMM Computer Communication Review, 1982
The clear advantages inherent in dynamic sharing of resources has accelerated the development of distributed processing. The number of networks which provide resource sharing have increased steadily from the early years of ARPA network. As the number of users sharing the resources increases, there is a potential danger for degradation of services, if ...
openaire +2 more sources
The clear advantages inherent in dynamic sharing of resources has accelerated the development of distributed processing. The number of networks which provide resource sharing have increased steadily from the early years of ARPA network. As the number of users sharing the resources increases, there is a potential danger for degradation of services, if ...
openaire +2 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
1987
A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time
Bogdan S. Chlebus +2 more
openaire +2 more sources
A saturating flow through a network satisfies the condition that if it uses an edge then it uses its whole capacity. We show that the problem to verify whether there is a non-zero saturating flow in a given network is strongly NP-complete. This problem restricted to edge series-parallel networks remains NP-complete, but there is a pseudopolynomial time
Bogdan S. Chlebus +2 more
openaire +2 more sources
2000
Maximum flow problems appear in many practical applications. In this paper, we study how to simplify a given directed flow network by finding edges that can be removed without changing the value of the maximum flow. We give a number of approaches which are increasingly more complex and more time-consuming, but in exchange they remove more and more ...
Therese C. Biedl +2 more
openaire +1 more source
Maximum flow problems appear in many practical applications. In this paper, we study how to simplify a given directed flow network by finding edges that can be removed without changing the value of the maximum flow. We give a number of approaches which are increasingly more complex and more time-consuming, but in exchange they remove more and more ...
Therese C. Biedl +2 more
openaire +1 more source
Complexity, Networks and Knowledge Flows
Academy of Management Proceedings, 2002The diffusion of knowledge plays an important role in both the creation and distribution of wealth. Attempting to construct a competitive advantage, managers of firms often seek to spread valuable knowledge widely across subunits of the organization, while simultaneously preventing its diffusion outside the firm to rivals.
Olav Sorenson, Jan Rivkin, Lee Fleming
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.
Ciro D'Apice +2 more
openaire +3 more sources
Network Information Flow in Network of Queues
2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems, 2008Two classic categories of models exist for computer networks: network information flow and network of queues. The network information flow model appropriately captures the multi-hop flow routing nature in general network topologies, as well as encodable and replicable properties of information flows.
Phillipa Gill +4 more
openaire +2 more sources
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
Problems of Information Transmission, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources