This item was digitized as part of the Million Books Project led by Carnegie Mellon University and supported by grants from the National Science Foundation (NSF). Cornell University coordinated the participation of land-grant and agricultural libraries in providing historical agricultural information for the digitization project; the University of Arizona Libraries, the College of Agriculture and Life Sciences, and the Office of Arid Lands Studies collaborated in the selection and provision of material for the digitization project.

Thesis (doctoral)--Lunds universitet, 1759 and 1766. / At head of title: J.H.J.N. Pt. 1 dated: 1759, and pt. 2 dated: 1766. Reproduction of original from Kress Library of Business and Economics, Harvard University. Goldsmiths'-Kress no. 09458.7.

Tesis de grado para obtener el titulo de Ingeniero Agronomo, Universidad Mayor De San Simon, Facultad de Ciencias Agricolas y Pecuarias "Dr. Martin Cardenas." / Abstract in Spanish and English.

Thesis (doctoral)--Universität Marburg, 1934. / Includes bibliographical references (p. 5-6).

Diss.--Leipzig (C.G. Biener, respondent).

Thesis (M.S.)--University of Wisconsin--Madison, 1915. / Typescript. eContent provider-neutral record in process. Description based on print version record.

Thesis (doctoral)--Universität Leipzig, 1924. / eContent provider-neutral record in process. Description based on print version record.

Thesis (M.S.)--University of Wisconsin--Madison. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 58-59).

In order to achieve the high performance, we need to have an efficient scheduling of a parallelprogram onto the processors in multiprocessor systems that minimizes the entire executiontime. This problem of multiprocessor scheduling can be stated as finding a schedule for ageneral task graph to be executed on a multiprocessor system so that the schedule length can be minimize [10]. This scheduling problem is known to be NP- Hard.In multi processor task scheduling, we have a number of CPU’s on which a number of tasksare to be scheduled that the program’s execution time is minimized. According to [10], thetasks scheduling problem is a key factor for a parallel multiprocessor system to gain betterperformance. A task can be partitioned into a group of subtasks and represented as a DAG(Directed Acyclic Graph), so the problem can be stated as finding a schedule for a DAG to beexecuted in a parallel multiprocessor system so that the schedule can be minimized. Thishelps to reduce processing time and increase processor utilization. The aim of this thesis workis to check and compare the results obtained by Bee Colony algorithm with already generatedbest known results in multi processor task scheduling domain.

Inaug.-Diss.--Marburg. / Lebenslauf. "Separat-Abdruck aus den Zoologischen Jahrbüchern, Bd. 22, Abt. f. Anatomie." Literaturverzeichnis": p. 39-40.