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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
6
search results - page 2 / 2
»
A simpler competitive analysis for scheduling equal-length j...
Sort
relevance
views
votes
recent
update
View
thumb
title
16
click to vote
SODA
2008
ACM
185
views
Algorithms
»
more
SODA 2008
»
Better bounds for online load balancing on unrelated machines
13 years 6 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 »