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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
107
click to vote
ALGORITHMICA
2005
63
views
more
ALGORITHMICA 2005
»
Minimizing Makespan and Preemption Costs on a System of Uniform Machines
15 years 2 months ago
Download
www.cs.technion.ac.il
Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
Real-time Traffic
ALGORITHMICA 2005
|
claim paper
Related Content
»
Preemptive Scheduling on Selfish Machines
»
Optimal Preemptive Scheduling for General Target Functions
»
Nonclairvoyant Scheduling Games
»
Equilibria for two parallel links The strong price of anarchy versus the price of anarchy
more »
Post Info
More Details (n/a)
Added
15 Dec 2010
Updated
15 Dec 2010
Type
Journal
Year
2005
Where
ALGORITHMICA
Authors
Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger
Comments
(0)
Researcher Info
ALGORITHMICA 2010 Study Group
Computer Vision