199,102 research outputs found
Die Leitidee Algorithmus und Zahl
No full textKleine M. Die Leitidee Algorithmus und Zahl. In: Blum W, Vogel S, Drüke-Noe C, Roppelt A, eds. Bildungsstandards aktuell: Mathematik in der Sekundarstufe II. Braunschweig: Westermann; 2015: 31-40
Demosthenes. Ausgewählte Reden erklärt von A. Westermann. Ites Bandchen. 10 to Auflage von E. Rosenberg
No full textM. A. Demosthenes. Ausgewählte Reden erklärt von A. Westermann. Ites Bandchen. 10 to Auflage von E. Rosenberg. In: Revue des Études Grecques, tome 15, fascicule 67,1902. p. 470
Hotline update of clinical trials and registries presented at the American College of Cardiology Congress 2010: ACCORD, INVEST, NAVIGATOR, RACE II, SORT OUT III, CSP-474, DOSE, ASPIRE and more
No full textThis article gives an overview on a number of novel clinical trials in the field of cardiovascular medicine, which were presented during the Late Breaking Clinical Trial Sessions at the 59th annual meeting of the American College of Cardiology in Atlanta, USA, from 14th March to 16th March 2010. The data were presented by leading experts in the field with relevant positions in the trials. These comprehensive summaries should provide the readers with the most recent data on diagnostic and therapeutic developments in cardiovascular medicine similar as previously reported (Schirmer SH, van der Laan AM, Bohm M, Mahfoud F in Clin Res Cardiol 98:691–699, 2009; Maier LS, Schirmer SH, Walenta K, Jacobshagen C, Bohm M in Clin Res Cardiol 98:413–419, 2009)
UNUSUAL BONDING IN A MAIN-GROUP MULTIPLE-BONDED SYSTEM - UMBRELLA-SHAPED DIPHOSPHENES
No full textBUSCH T, Schoeller W, NIECKE E, NIEGER M, WESTERMANN H. UNUSUAL BONDING IN A MAIN-GROUP MULTIPLE-BONDED SYSTEM - UMBRELLA-SHAPED DIPHOSPHENES. INORGANIC CHEMISTRY. 1989;28(24):4334-4340
M. Kolsen - Die beiden Kreuzlieder des Trobadors Guiraut von Bornelh, nach saemtlichen Handschriften kritisch herausgegeben und übersetz. Braunschweijg, Westermann, 1905
No full textJeanroy Alfred. M. Kolsen - Die beiden Kreuzlieder des Trobadors Guiraut von Bornelh, nach saemtlichen Handschriften kritisch herausgegeben und übersetz. Braunschweijg, Westermann, 1905. In: Annales du Midi : revue archéologique, historique et philologique de la France méridionale, Tome 17, N°68, 1905. pp. 535-536
Europe 1925
No full text"Die Karte ist der erste Versuch einer Wandkarte der Rassenverteilung in Europa auf Grundlage der neueren Forschung, mit vorwiegender Benutzung der Arbeiten von J. Deniker, W. Ripley, M. Grant, O. Hauser, H. Günther, E. Fischer und G. Kraitschek."Color;1:5,000,00
Supplemental Material, sj-pdf-1-top-10.1177_0098628320985080 - Training Structural Awareness with StatHand: A 1 Year Follow-Up
No full textSupplemental Material, sj-pdf-1-top-10.1177_0098628320985080 for Training Structural Awareness with StatHand: A 1 Year Follow-Up by Peter J. Allen, Jessica L. Fielding, Annabel H. Westermann and Amelia M. Lafratta in Teaching of Psychology</p
Bewegungslehre
No full textKibele A, Gramstadt M, Wegner C, et al. Bewegungslehre. Gelbe Reihe. Vol 1 1st ed. Schroedel: Westermann Schroedel Diesterweg Schöning Winklers GMbH; 2015
Online Makespan Scheduling with Job Migration on Uniform Machines
Get PDFIn the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with sizes. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper, we consider online scheduling algorithms without preemption. However, we allow the online algorithm to reassign up to k jobs to different machines in the final assignment.
For m identical machines, Albers and Hellwig (Algorithmica, 2017) give tight bounds on the competitive ratio in this model. The precise ratio depends on, and increases with, m. It lies between 4/3 and ~~ 1.4659. They show that k = O(m) is sufficient to achieve this bound and no k = o(n) can result in a better bound.
We study m uniform machines, i.e., machines with different speeds, and show that this setting is strictly harder. For sufficiently large m, there is a delta = Theta(1) such that, for m machines with only two different machine speeds, no online algorithm can achieve a competitive ratio of less than 1.4659 + delta with k = o(n).
We present a new algorithm for the uniform machine setting. Depending on the speeds of the machines, our scheduling algorithm achieves a competitive ratio that lies between 4/3 and ~~ 1.7992 with k = O(m). We also show that k = Omega(m) is necessary to achieve a competitive ratio below 2.
Our algorithm is based on a subtle imbalance with respect to the completion times of the machines, complemented by a bicriteria approximation algorithm that minimizes the makespan and maximizes the average completion time for certain sets of machines
Dr. Duane M. Jackson, Morehouse College, July 2011
No full textThis video is a conversation with Dr. Duane M. Jackson. Dr. Jackson talks about his paper, "Recall and the Serial Position Effect: The Role of Primacy and Recency on Accounting Students' Performance." Jackie Daniel, AUC Woodruff Library, is the interviewer
- …
