Search
Now showing items 1-8 of 8
Fair Allocation of Discrete Bandwidth Layers in Multicast Networks
(1999)
We study fairness when receivers in a multicast network can not subscribeto fractional layers. This case arises whenthe source hierarchically encodes its signal and the hierarchical structureis predetermined. Unlike the ...
The Set-Valued Run-to-Run Controller in Semiconductor Manufacturing Processes
(1999)
In semiconductor manufacturing, run-to-run (RtR) control is paid moreand more attention. In this paper a set-valuedRtR control scheme is introduced. Different from conventional RtR controlmethods, the set-valued method ...
A Genetic Algorithm for a Minimax Network Design Problem
(1999)
This paper considers the problem of designing a network to transport material from sources of supply to sites where demand occurs. However, the demand at each site is uncertain. We formulate the problem as a robust discrete ...
Structural Matrix Computations with Units: Data Structures, Algorithms, and Scripting Language Design
(1999)
Despite the well-known benefits of physical units, matrices,and matrix algebra in engineering computations,most engineering analysis packages are essentially dimensionless.They simply hold the engineer responsible for ...
Solving POMDP by Onolicy Linear Approximate Learning Algorithm
(1999)
This paper presents a fast Reinforcement Learning (RL) algorithm to solve Partially Observable Markov Decision Processes (POMDP) problem. The proposed algorithm is devised to provide a policyשּׂaking framework for Network ...
Distributed Algorithms for Computation of Fair Rates in Multirate Multicast Trees
(1999)
We study fairness in arbitrary networks with multicast capabilities.Multicast traffic in internet and ATM provides a motivationfor studying these networks. A study of fairness in multicastnetworks poses several interesting ...
Simulation-Based Algorithms for Average Cost Markov Decision Processes
(1999)
In this paper, we give a summary of recent development of simulation-based algorithmsfor average cost MDP problems, which are different from those for discounted cost problems or shortest pathproblems. We introduce both ...
Tabu Search for a Network Loading Problem
(1999)
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertices is achieved through a network of fiber ...