Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: communication
Found
444 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Optimal admission control in a queueing system with heterogeneous traffic
2003,
Dudin A.N.
We consider optimal admission control of the GI/PH/1-type queueing system. The problem...
How the presence of passengers influences the risk of a collision with another vehicle
2002,
Vollrath Mark
The risk of a collision with another vehicle due to the presence of passengers is...
The path restoration version of the spare capaciity allocation problem with modularity restrictions: models, algorithms, and an empirical analysis
2001,
Kennington Jeffery L.
This investigation presents a strategy to construct a compact mathematical model of...
Capacitated network design with uncertain demand
2002,
Andersen Kim Allan
We consider a capacity-expansion problem arising in the design of telecommunication...
A fast task-to-processor assignment heuristic for real-time multiprocessor digital signal processing applications
2003,
Chinneck John W.
The optimal assignment of the tasks to the processors to minimize total delay in a...
Fast permutation routing in a class of interconnection networks
2002,
Elmallah Ehab S.
This paper considers the following permutation routing problem: Given an N × N...
Optimization models for asynchronous transfer mode network planning
2003,
Dietz Dennis C.
This article describes mathematical programming models that have been developed and...
A queueing model with input of Moving Picture Exports Group (MPEG) frame sequence and interfering traffic
2002,
Takagi Hideaki
We study a queueing system having a mixture of a special semi-Markov process (SSMP)...
Dynamic mobility management for cellular networks: A delayed renewal process approach
2002,
Takagi Hideaki
Tracking mobile users in cellular wireless networks involves two basic functions:...
Optimization of an internationally distributed air–ground airline telecommunication system
2003,
Sans Brunilde
This paper presents the problem of optimally dimensioning a new geographically...
Statistical computing and graphics. Let's practice what we preach: Turning tables into graphs
2002,
Gelman Andrew
Statisticians recommend graphical displays but often use tables to present their own...
Analysis of M/M/S queues with 1-limited service
2002,
Tyagi A.
In this paper, a multiple server queue, in which each server takes a vacation after...
Repeated communication through the mechanism ‘and’
2001,
Vieille N.
We consider the ‘and’ communication device that receives inputs from two...
An algorithm for calculating flow-based network survivability
2001,
Kim Hyun-Joon
Survivability of a network is one of the most important issues in designing...
Minimizing the span of d-walks to compute optimum frequency assignments
2002,
Sassano A.
In this paper we deal with the Minimum Span Frequency Assignment Problem (MSFAP), that...
File distribution in networks with multimedia storage servers
2001,
Panwar Shivendra S.
In this paper, we consider a problem in networks with storage servers for providing...
Performance analysis of finite buffer discrete-time queue with bulk service
2002,
Gupta U.C.
Discrete-time queues are extensively used in modelling the asynchronous transfer mode...
Port partitioning and dynamic queueing for internet protocol forwarding
2002,
Lee Chae Y.
With the increase of internet protocol packets the performance of routers became an...
Performance analysis of a server for facsimile communication networks
2001,
Takahashi Y.
We present a performance analysis of a multiaddress call extraction server. The...
On cost allocation in hub-like networks
2001,
Skorin-Kapov Darko
We consider telecommunication network design in which each pair of nodes can...
Source-limited inclusive routing: A new paradigm for multicast communication
2000,
Torng Eric
In this paper, we study a combination of the multicast communication problem and the...
Graphs with given connectivity properties
1997,
Lawrencenko Serge
A node of a graph G , thought of as representing a communication network, is said to...
Optimal edge coloring of large graphs
1999,
Gmez J.
Most of the general families of large considered graphs in the context of the...
A tabu search heuristic for the Steiner tree problem
1999,
Gendreau Michel
The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has...
First Page
8
9
10
11
12
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers