A modification for an optimal routing algorithm for all-optical networks

Download
082828.pdf
1999
Yıldız, Koray
Show full item record
30
views
0
downloads
https://hdl.handle.net/11511/2408
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

A Comparison Method For Association Rule Mining Algorithms
Azadıamın, Sanam; Köksal, Gülser (null; 2016-11-15)
A simplified approach for slope stability analysis of uncontrolled waste dumps
TÜRER, DİLEK; Türer, Ahmet (SAGE Publications, 2011-02-01)
Slope stability analysis of municipal solid waste has always been problematic because of the heterogeneous nature of the waste materials. The requirement for large testing equipment in order to obtain representative samples has identified the need for simplified approaches to obtain the unit weight and shear strength parameters of the waste. In the present study, two of the most recently published approaches for determining the unit weight and shear strength parameters of the waste have been incorporated in...
A NEW HEURISTIC APPROACH FOR THE MULTIITEM DYNAMIC LOT-SIZING PROBLEM
KIRCA, O; KOKTEN, M (Elsevier BV, 1994-06-09)
In this paper a framework for a new heuristic approach for solving the single level multi-item capacitated dynamic lot sizing problem is presented. The approach uses an iterative item-by-item strategy for generating solutions to the problem. In each iteration a set of items are scheduled over the planning horizon and the procedure terminates when all items are scheduled. An algorithm that implements this approach is developed in which in each iteration a single item is selected and scheduled over the planni...
A decomposition approach for undiscounted two-person zero-sum stochastic games
Avşar, Zeynep Müge (Springer Science and Business Media LLC, 1999-06-01)
Two-person zero-sum stochastic games are considered under the long-run average expected payoff criterion. State and action spaces are assumed finite. By making use of the concept of maximal communicating classes, the following decomposition algorithm is introduced for solving two-person zero-sum stochastic games: First, the state space is decomposed into maximal communicating classes. Then, these classes are organized in an hierarchical order where each level may contain more than one maximal communicating ...
A decomposition approach for undiscounted two-person zero-sum stochastic games
Baykal-gürsoy, Melike; Avşar, Zeynep Müge (null; 1999-12-07)
Two-person zero-sum stochastic games are considered under the long-run average expected payoff criterion. State and action spaces are assumed finite. By making use of the concept of maximal communicating classes, the following decomposition algorithm is introduced for solving two-person zero-sum stochastic games: First, the state space is decomposed into maximal communicating classes. Then, these classes are organized in an hierarchical order where each level may contain more than one maximal communicating ...
Citation Formats
K. Yıldız, “A modification for an optimal routing algorithm for all-optical networks,” Middle East Technical University, 1999.
METU IIS - Integrated Information Service open@metu.edu.tr