Results 211 to 220 of about 1,267,357 (242)
Some of the next articles are maybe not open access.
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006
Consider the following network design problem: given a network G = (V, E), source-sink pairs {si, ti} arrive and desire to send a unit of flow between themselves. The cost of the routing is this: if edge e carries a total of fe flow (from all the terminal pairs), the cost is given by Σ el(fe), where l is some concave cost function; the goal is to ...
Anupam Gupta 0001 +2 more
openaire +2 more sources
Consider the following network design problem: given a network G = (V, E), source-sink pairs {si, ti} arrive and desire to send a unit of flow between themselves. The cost of the routing is this: if edge e carries a total of fe flow (from all the terminal pairs), the cost is given by Σ el(fe), where l is some concave cost function; the goal is to ...
Anupam Gupta 0001 +2 more
openaire +2 more sources
Operations Research, 1998
The goal of this paper is to understand choices of networks and schedules by a profit maximizing airline. By “network” we mean the routing pattern for planes and by “schedule” we mean the frequency of service between cities and the amount of time put into the schedule to assure on-time arrival. This paper analyzes network and schedule choice using an “
Phillip J. Lederer +1 more
openaire +2 more sources
The goal of this paper is to understand choices of networks and schedules by a profit maximizing airline. By “network” we mean the routing pattern for planes and by “schedule” we mean the frequency of service between cities and the amount of time put into the schedule to assure on-time arrival. This paper analyzes network and schedule choice using an “
Phillip J. Lederer +1 more
openaire +2 more sources
Boolean Network Probabilities and Network Design
IEEE Transactions on Computers, 1978The correspondence between Boolean network probabilities and the design formalisms of Ledley and Aiken is demonstrated.
Edward J. McCluskey +2 more
openaire +2 more sources
2013 IEEE International Conference on Communications (ICC), 2013
In this paper, we address the problem of robust network design. Robustness is defined as the minimizing variations in network performance, such as average delay and throughput, due to the perturbations in the network, e.g. topology, demand and community of interest.
Armin Ghayoori, Alberto Leon-Garcia
openaire +1 more source
In this paper, we address the problem of robust network design. Robustness is defined as the minimizing variations in network performance, such as average delay and throughput, due to the perturbations in the network, e.g. topology, demand and community of interest.
Armin Ghayoori, Alberto Leon-Garcia
openaire +1 more source
Trends in Plant Science, 1999
The intrinsic capacity of the shoot apical meristem for self-regulation and the positional specification of its cells implies the existence of an elaborate and versatile communication network. We propose a model that pictures this network as a system of overlapping signal circuits, which support local tasks as well as coordinating indeterminate shoot ...
van der Schoot, C., Rinne, P.
openaire +3 more sources
The intrinsic capacity of the shoot apical meristem for self-regulation and the positional specification of its cells implies the existence of an elaborate and versatile communication network. We propose a model that pictures this network as a system of overlapping signal circuits, which support local tasks as well as coordinating indeterminate shoot ...
van der Schoot, C., Rinne, P.
openaire +3 more sources
IEEE Network, 1992
Systems Network Architecture (SNA) provides users with services needed in a networking environment: sharing of communication lines, directory services, connection establishment, improved reliability, management services, and an appropriate interface and set of facilities for distributed programming.
Diane Pozefsky +2 more
openaire +1 more source
Systems Network Architecture (SNA) provides users with services needed in a networking environment: sharing of communication lines, directory services, connection establishment, improved reliability, management services, and an appropriate interface and set of facilities for distributed programming.
Diane Pozefsky +2 more
openaire +1 more source
On the design of reliable networks
Networks, 1973AbstractThis paper is concerned with construction of graphs, with n vertices and m edges, whose connectivity r = [2m/n] ≧ 3, and have no more than n minimum vertex cut‐sets. Frank's results imply that this is an important step in the design of a class of reliable networks.
S. Louis Hakimi, Ashok T. Amin
openaire +2 more sources
Design for network communities
Proceedings of the ACM SIGCHI Conference on Human factors in computing systems, 1997Collaboration has long been of considerable interest in the CHI community. This paper proposes and explores the concept of network communities as a crucial part of this discussion. Network communities are a form of technologymediated environment that foster a sense of community among users.
Elizabeth D. Mynatt +3 more
openaire +1 more source
IFAC Proceedings Volumes, 2008
Abstract The application of the Industrial Ethernet brings up issues of both the reliability and behaviour of the networks under a demanded load, while preserving the permitted time delay in the whole network. We propose an algorithm that designs the network topology, which meets the required fault tolerance and allows reliable communication between ...
Tomas Fencl, Pavel Burget, Jan Bilek
openaire +1 more source
Abstract The application of the Industrial Ethernet brings up issues of both the reliability and behaviour of the networks under a demanded load, while preserving the permitted time delay in the whole network. We propose an algorithm that designs the network topology, which meets the required fault tolerance and allows reliable communication between ...
Tomas Fencl, Pavel Burget, Jan Bilek
openaire +1 more source