• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 227
  • 42
  • 11
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 4
  • 3
  • 3
  • 2
  • Tagged with
  • 391
  • 296
  • 76
  • 71
  • 64
  • 62
  • 47
  • 44
  • 37
  • 35
  • 32
  • 32
  • 32
  • 32
  • 32
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
111

Resource allocation in parallel processing systems

Menich, Ronald Paul 12 1900 (has links)
No description available.
112

Design procedures for "pull" production systems

Uribe, Jaime Trevino 12 1900 (has links)
No description available.
113

Statistical behaviour of a multiplexor with a priority input.

Martens, Walter January 1972 (has links)
No description available.
114

Queues and packet multiplexing networks

Shalmon, Michael S. January 1985 (has links)
This thesis has to do with certain fundamental queues that are well established as models for delay in simple packet-switching concentrators and networks. We first revisit the single server queue with Poisson arrivals and general independent service times. We then work out a complete delay analysis for a traffic concentrating tandem network of queues with deterministic service and batch Poisson sources connected to every node; this is the most comprehensive analysis available for a network which is not of Jackson type. We also show how to (partially) extend the analysis to a concentrating tree network, and to an arrival process somewhat more general that batch Poisson. / The two parts of the thesis have a close methodological relationship. Our contribution in both cases is to rederive certain known results, and to produce a variety of new ones, using techniques that are essentially qualitative. Our particular view of the stochastic processes in question is guided by a very special queue discipline, namely Last Come First Served preemptive resume; by identifying certain structural features of the sample paths, one can read, almost without calculation, a host of statistics of common interest. The LCFS preemptive resume discipline also enables us: (i) to strengthen the connection between the single server queue with general independent service times and interarrival times, and the fluctuation theory of random walks; (ii) to strengthen the connection between the queue with Poisson arrivals and branching processes.
115

Some contributions to the fields of insensitivity and queueing theory / by Michael P. Rumsewicz

Rumsewicz, Michael Peter January 1988 (has links)
Includes summary / Bibliography: leaves 108-112 / vii, 112 leaves : ill ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Applied Mathematics, 1989
116

Some problems in queueing theory / by Andrew James Coyle

Coyle, Andrew James January 1989 (has links)
Bibliography: leaves 147-152 / vii, 152 leaves : ill ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, Dept. of Applied Mathematics, 1990
117

Blocking in teletraffic systems under nonstationary arrival and service conditions / by Muhammad Naim Yunus

Yunus, Muhammad Naim January 1985 (has links)
Bibliography: leaves 102-104 / viii, 115 leaves : ill ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / Thesis (Ph.D.)--University of Adelaide, 1986
118

Time dependent queuing systems

Flick, Allen E., Liao, Ming. January 2008 (has links)
Thesis--Auburn University, 2008. / Abstract. Vita. Includes bibliographic references (p.35).
119

Sample path analysis of stochastic processes busy periods of auto-correlated single server queues /

Garikiparthi, Chaitanya N. Liefvoort, Appie van de. January 2008 (has links)
Thesis (Ph. D.)--School of Computing and Engineering. University of Missouri--Kansas City, 2008. / "A dissertation in computing networking and telecommunications networking." Advisor: Appie van de Liefvoort. Typescript. Vita. Title from "catalog record" of the print edition Description based on contents viewed Feb. 6, 2009. Includes bibliographical references (leaves 85-89). Online version of the print edition.
120

Optimum levels of work in process (WIP) for navy field contracting organizations a decision rule /

Qua, John F. January 1990 (has links)
Thesis (M.S. in Management)--Naval Postgraduate School, December 1990. / Thesis Advisor: Lamm, David V. Second Reader: Caldwell, William J. "December 1990." Description based on title screen as viewed on April 1, 2010. DTIC Identifier(s): Contract administration, decision making, navy, WIP(work in process), backlogs, regression analysis, small purchase actions, procurement, theses. Author(s) subject terms:Decision rule, contracting, small purchase, backlog. Includes bibliographical references (p. 63-64). Also available in print.

Page generated in 0.047 seconds