Mean value algorithms and heuristics for queueing networks

Download
028895.pdf
1993
Arapoğlu, Rifat Aykut
Show full item record
60
views
144
downloads
https://hdl.handle.net/11511/9839
Graduate School of Natural and Applied Sciences, Thesis

Suggestions

Mean curve length: An efficient feature for brainwave biometrics
Yahyaei, Reza; Özkurt, Tolga Esat (2022-07-01)
Electroencephalography (EEG) as a biometric modality has gained considerable interest in recent years. Many state-of-the-art methods have focused on increasing the recognition accuracy. However, the more complex and manipulative the methods become, the less practical and generalized they are in real-life applications. In this study, we prioritized computational efficiency and evaluated the model performance. In this direction, we propose the mean curve length (MCL), a simple measure quantifying signal compl...
Mean-Shift Tracking for Surveillance Applications Using Thermal and Visible Band Data Fusion
Beyan, Cigdem; Temizel, Alptekin (2011-04-28)
Separate tracking of objects such as people and the luggages they carry is important for video surveillance applications as it would allow making higher level inferences and timely detection of potential threats. However, this is a challenging problem and in the literature, people and objects they carry are tracked as a single object. In this study, we propose using thermal imagery in addition to the visible band imagery for tracking in indoor applications (such as airports, metro or railway stations). We u...
Mean ergodicity of positive operators in KB-space
Alpay, S.; Binhadjah, A.; Emelyanov, Eduard; Ercan, Z. (Elsevier BV, 2006-11-01)
We prove that any positive power bounded operator T in a KB-space E which satisfies
Shortest path analysis in dynamic transportation networks by expert systems: a case study in Ankara, Bahcelievler district by using genetic algorithms
Eke, Gökhan; Işık, Oğuz; Atalay, Volkan; Department of Geodetic and Geographical Information Technologies (2003)
Minimum-weight spanning tree algorithms - A survey and empirical study
Bazlamaçcı, Cüneyt Fehmi (2001-07-01)
The minimum-weight spanning tree problem is one of the most typical and well-known problems of combinatorial optimisation. Efficient solution techniques had been known for many years. However, in the last two decades asymptotically faster algorithms have been invented. Each new algorithm brought the time bound one step closer to linearity and finally Karger, Klein and Tarjan proposed the only known expected linear-time method. Modern algorithms make use of more advanced data structures and appear to be more...
Citation Formats
R. A. Arapoğlu, “Mean value algorithms and heuristics for queueing networks,” Middle East Technical University, 1993.
METU IIS - Integrated Information Service open@metu.edu.tr