Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
Making Random Choices Invisible to the Scheduler
Sort
relevance
views
votes
recent
update
View
thumb
title
176
click to vote
SODA
2008
ACM
185
views
Algorithms
»
more
SODA 2008
»
Better bounds for online load balancing on unrelated machines
15 years 7 months ago
Download
www.ceid.upatras.gr
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...
Ioannis Caragiannis
claim paper
Read More »
« Prev
« First
page 2 / 2
Last »
Next »