Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 400 for “"Queue"”.

  1. Coffee Queue Project

    <p>In this paper, a computer vision system for counting people standing in line is presented. In this application, common techniques such as Adaptive Background Subtraction (ABS), blob tracking with Kalman filter, and occlusion resistive techniques are used to detect and track people. Additionally, …

    calpoly Repository record for Coffee Queue Project (opens in a new tab)

  2. Empirical verification of modeled queue lengths

    … with an exclusive left turn lane. If left turn queues are not accurately estimated, they may be the source of these safety issues counteracting the benefits of the left turn lane. The accurate determination of left turn queues is very critical for the safety and efficient operation of an …

    unm Repository record for Empirical verification of modeled queue lengths (opens in a new tab)

  3. Queue scheduling the Alan Cousins Telescope

    … been made by a full hardware interface to allow queue executions of observations. The next phase is the implementation of an automated scheduler that will generate a queue of valid observations for each night of observation. Queue scheduling algorithms are widely used in astronomy and the aim of …

    cape-town Repository record for Queue scheduling the Alan Cousins Telescope (opens in a new tab)

  4. Compilation to a queue-based architecture

    Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.

    mit Repository record for Compilation to a queue-based architecture (opens in a new tab)

  5. Queue arrival control with partial observations

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1987.

    mit Repository record for Queue arrival control with partial observations (opens in a new tab)

  6. Achievable rates for queue-based timing stegocodes

    … codes are based on two novel ideas, namely, queue- based codes and Shannon's encoding functions for channels with causal side information at the transmitter. The embedding of information bits is done by a Geo/Geo/1 queue servicing the interarrival times. Shannon's theory of coding with causal …

    uiuc Repository record for Achievable rates for queue-based timing stegocodes (opens in a new tab)

  7. Micro load balancing with delayed queue lengths

    … in modern data centers. It uses egress port queue lengths to make fast packet routing decisions to reduce upstream congestion and queueing delays. However, high performance switches with multiple forwarding engines making routing decisions in parallel, do not have direct access to these queue

    uiuc Repository record for Micro load balancing with delayed queue lengths (opens in a new tab)

  8. The SprayList : a scalable relaxed priority queue

    High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in …

    mit Repository record for The SprayList : a scalable relaxed priority queue (opens in a new tab)

  9. Queue with Random Arrivals and Exponential Service Times

    Queues for service of one kind or another arise in many different fields of activity. In recent years a considerable amount of research has been conducted into the properties of simplified mathemtical models of such queuing systems. Initially, it was my aim to present a short but balanced survey of …

    creighton Repository record for Queue with Random Arrivals and Exponential Service Times (opens in a new tab)

  10. New directions in queue inference for management implementation

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.

    mit Repository record for New directions in queue inference for management implementation (opens in a new tab)

  11. Asymptotic performance of queue length based network control policies

    … Second, many network control tasks utilize queue length information to perform effectively, which inevitably adds to the control overheads in a network. Therefore, it is important to understand the role played by queue length information in network control, and its impact on various …

    mit Repository record for Asymptotic performance of queue length based network control policies (opens in a new tab)

  12. Analysis of Alternative Queue Systems in Simulated Amusement Parks

    … seeks to analyze the effects of alternative queueing systems on guest welfare in amusement parks. Many parks have implemented these systems, allowing some guests to skip the traditional lines for attractions. This project entailed building an amusement park simulation system, permitting …

    mit Repository record for Analysis of Alternative Queue Systems in Simulated Amusement Parks (opens in a new tab)

  13. Problems in feedback queueing systems with symmetric queue disciplines

    In this paper we study properties of a queue with instantaneous Bernoulli feedback where the service discipline is one of two symmetric disciplines. For the processor sharing queue with exponentially distributed service requirements we analyze the departure process, imbedded queue lengths, and the …

    vt Repository record for Problems in feedback queueing systems with symmetric queue disciplines (opens in a new tab)

  14. Analysis of P2P file transferring system by stochastic queue models

    … a P2P file transferring network by a stochastic queue model. After presenting a general stochastic model, we discuss three cases obtained by specializing the general model using three different choices of parameter values and selection strategies. In the first case, we deal with a simple model …

    uiuc Repository record for Analysis of P2P file transferring system by stochastic queue models (opens in a new tab)

  15. Analysis of a tandem queue model of a transfer line

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1982.

    mit Repository record for Analysis of a tandem queue model of a transfer line (opens in a new tab)

  16. Queue occupancy in single-server deterministic service time tree networks

    … of single server, deterministic service time queues are often used as models for packet flow in systems with ATM traffic. In this thesis, we present methods of analyzing packet occupancy in these systems. We develop general theorems which enable the analysis of individual nodes within a …

    mit Repository record for Queue occupancy in single-server deterministic service time tree networks (opens in a new tab)

  17. On queue audience--calculating reach and frequency for supermarket television

    Thesis (M.S.)--Massachusetts Institute of Technology, Sloan School of Management, 1991.

    mit Repository record for On queue audience--calculating reach and frequency for supermarket television (opens in a new tab)

  18. A Wait-free Queue with Poly-logarithmic Worst-case Step Complexity

    … we introduce a novel linearizable wait-free queue implementation. Linearizability and lock-freedom are standard requirements for designing shared data structures. To the best of our knowledge, all of the existing linearizable lock-free queues in the literature have a common problem in their …

    york Repository record for A Wait-free Queue with Poly-logarithmic Worst-case Step Complexity (opens in a new tab)

Page 1 of 20