Results 151 to 160 of about 62,265 (211)

Step-Wise Dual Dynamic DPSGD: Enhancing Performance on Imbalanced Medical Datasets with Differential Privacy. [PDF]

Entropy (Basel)
Huang X, Xie F.
europepmc   +1 more source

Models and algorithms for stochastic online scheduling.

Uetz, Marc, Megow, Nicole, Vredeveld, Tjark   +2 more
core  

Some of the next articles are maybe not open access.

Related searches:

Parallel Scheduling Algorithms

Operations Research, 1983
Parallel algorithms are given for scheduling problems such as scheduling to minimize the number of tardy jobs, job sequencing with deadlines, scheduling to minimize earliness and tardiness penalties, channel assignment, and minimizing the mean finish time. The shared memory model of parallel computers is used to obtain fast algorithms.
Eliezer Dekel, Sartaj Sahni
exaly   +2 more sources

On Manpower Scheduling Algorithms

SIAM Review, 1982
This paper provides a systematic review of several of the available manpower scheduling algorithms from a common framework. The five-stage framework is based on the recognition that the general scheduling problem can be decomposed into five separate but related subproblems or stages, namely, the determination of temporal manpower requirements, total ...
Tien, James M., Kamiyama, Angelica
openaire   +2 more sources

Iterative Scheduling Algorithms

IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications, 2007
The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switch is the scheduling algorithm that decides which packets to transfer from ingress ports to egress ports in a given timeslot. It is desirable that such algorithms be iterative (so
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Mayank Sharma   +3 more
openaire   +1 more source

Parallelization of scheduling algorithms

Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96), 2002
Most static scheduling algorithms that schedule parallel programs represented by directed acyclic graphs (DAGs) are sequential. Parallelization of scheduling algorithms is a new research area. This paper discusses the essential issues of parallel static scheduling and presents an efficient parallel scheduling algorithm, the HPMCP algorithm.
Min-You Wu, Wei Shu
openaire   +1 more source

On synthesis of scheduling algorithms

Information Processing Letters, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. G. Gupta, V. S. P. Srivastava
openaire   +1 more source