Keyword: networks

Found 1865 papers in total
Analysis of a multi-server queueing model of Available Bit Rate
Analysis of a multi-server queueing model of Available Bit Rate
1998,
In this paper we present a queueing model for the performance analysis of Available...
Multiserver queueing networks and the tandem queue model
Multiserver queueing networks and the tandem queue model
1998,
Using a tandem queue model we evaluate the local ‘endogenous’ (= internal)...
Modelling aspects of distributed processing in telecommunication networks
Modelling aspects of distributed processing in telecommunication networks
1998,
The purpose of this paper is to formally describe new optimization models for...
A design of self-healing ATM networks based on backup virtual paths
A design of self-healing ATM networks based on backup virtual paths
1998,
We propose a design of self-healing ATM virtual path (VP) networks based on backup VP....
Designing tributary networks with multiple ring families
Designing tributary networks with multiple ring families
1998,
A common architecture for a telecommunications network consists of several tributary...
Coordinated replenishments from multiple suppliers with price discounts
Coordinated replenishments from multiple suppliers with price discounts
1998,
In this study we present an integer programming model for determining an optimal...
The robustness of mean and variance approximations in risk analysis
The robustness of mean and variance approximations in risk analysis
1998,
This paper examines further the problem of estimating the mean and variance of a...
Partially-linear transportation problems, obtained by means of absolute value functions
Partially-linear transportation problems, obtained by means of absolute value functions
1997,
Nonlinear transportation problems may be successfully used to model problems in...
Correlation of interdeparture times in M/G/1 and M/G/1/K queues
Correlation of interdeparture times in M/G/1 and M/G/1/K queues
1998,
Correlation of consecutive interdeparture times characterizes the output process in a...
Reformulation of the set partitioning problem as a pure network with special order set constraints
Reformulation of the set partitioning problem as a pure network with special order set constraints
1998,
In this paper, the set partitioning problem is reformulated as a network flow problem...
An exact solution approach based on shortest-paths for p-hub median problems
An exact solution approach based on shortest-paths for p-hub median problems
1998,
The problem of locating hub facilities arises in the design of transportation and...
Critical path in an activity network with time constraints
Critical path in an activity network with time constraints
1997,
An acyclic graph with nonnegative weights and with a unique source and destination is...
Joint configuration of backbone and logical networks on a reconfigurable packet-switched network with unreliable links
Joint configuration of backbone and logical networks on a reconfigurable packet-switched network with unreliable links
1998,
This paper considers a problem of configuring both backbone and logical networks in a...
Optimal lines for railway systems
Optimal lines for railway systems
1997,
We discuss the optimal choice of traffic lines with periodic timetables on a railway...
Efficient routing of service vehicles
Efficient routing of service vehicles
1997,
Arc routing problems arise in a number of settings where vehicles must traverse...
Multiobjective watershed-level, planning of storm water detention systems
Multiobjective watershed-level, planning of storm water detention systems
1997,
Detention basins are the most popular structural measure for urban flood control and...
A polynomial time primal network simplex algorithm for minimum cost flows
A polynomial time primal network simplex algorithm for minimum cost flows
1997,
Developing a polynomial time primal network simplex algorithm for the minimum cost...
A new strongly polynomial dual network simplex algorithm
A new strongly polynomial dual network simplex algorithm
1997,
This paper presents a new dual network simplex algorithm for the minimum cost network...
On strongly polynomial dual simplex algorithms for the maximum flow problem
On strongly polynomial dual simplex algorithms for the maximum flow problem
1997,
Several pivot rules for the dual network simplex algorithm that enable it to solve a...
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
1997,
The dynamic tree> is an abstract data type that allows the maintenance of a...
How to compute least infeasible flows
How to compute least infeasible flows
1997,
It is well-known how to use maximum flow to decide when a flow problem with demands,...
Multiflows and disjoint paths of minimum total cost
Multiflows and disjoint paths of minimum total cost
1997,
In this paper we discuss a number of recent and earlier results in the field of...
A heuristic model selection criterion using distorter and its application to determination of the number of hidden units in RBFN
A heuristic model selection criterion using distorter and its application to determination of the number of hidden units in RBFN
1998,
In applying neural networks it is an important but difficult problem to determine the...
GMDH type neural network algorithm identifying a network structure with the heuristic self-organization method
GMDH type neural network algorithm identifying a network structure with the heuristic self-organization method
1998,
A GMDH type neural network algorithm which can identify a nonlinear system whose...
Papers per page: