Minimizing Expected Makespans on Uniform Processor Systems

Advances in Applied Probability - United Kingdom
doi 10.2307/1427379
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Minimizing the Expected Rank With Full Information

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
1993English

Slicing Based Code Parallelization for Minimizing Inter-Processor Communication

2009English

Minimizing Makespan and Preemption Costs on a System of Uniform Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Minimizing Decoherence on Target in Bipartite Open Quantum Systems

2019English

Speech Recognition Systems on the Cell Broadband Engine Processor

IBM Journal of Research and Development
Computer Science
2007English

On Minimizing Errors in 3D Reconstruction for Stereo Camera Systems

Pattern Recognition and Image Analysis
Pattern RecognitionComputer VisionComputer GraphicsComputer-Aided Design
2007English

Improving Workload Balance and Code Optimization on Processor-In-Memory Systems

Journal of Systems and Software
HardwareInformation SystemsArchitectureSoftware
2004English

A Move Processor for Bio-Inspired Systems

English

Processor Allocation and Task Scheduling of Matrix Chain Products on Parallel Systems

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy