Interval scheduling

Results: 25



#Item
21Complexity classes / Mathematical optimization / Operations research / Scheduling algorithms / Scheduling / NP / Interval scheduling / Graph coloring / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics

LNCS[removed]Interval Selection with Machine-Dependent Intervals

Add to Reading List

Source URL: www.coga.tu-berlin.de

Language: English - Date: 2014-05-22 11:02:32
22Electronic engineering / Scheduling algorithms / Operations research / Planning / Scheduling / Programmable interval timer / Preemption / Linux kernel / Interrupt / Computer architecture / Computing / Concurrent computing

Supporting Time-Sensitive Applications on a Commodity OS Ashvin Goel, Luca Abeni, Charles Krasic, Jim Snow, Jonathan Walpole Department of Computer Science and Engineering Oregon Graduate Institute, Portland {ashvin,luca

Add to Reading List

Source URL: jsnow.bootlegether.net

Language: English - Date: 2014-03-01 01:04:21
23Public administration / Project management / Scheduling algorithms / Certified Public Manager

                 Total    Interval  Highest Hi Time   Lowest  Lo Time  

Add to Reading List

Source URL: www.seintl.com

Language: English - Date: 2014-01-07 11:45:25
24Job scheduler / Normal distribution / Confidence interval / San Diego Supercomputer Center / Scheduling / Statistics / Statistical inference / Operations research

Metrics for Parallel Job Scheduling and their Convergence Dror G. Feitelson School of Computer Science and Engineering The Hebrew University, 91904 Jerusalem, Israel http://www.huji.ac.il/˜feit

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2010-04-25 07:17:57
25Analysis of algorithms / Charging argument / Scheduling algorithms / Operations research / Graph coloring / Interval scheduling / NP-complete problems / Greedy algorithm / Algorithm / Mathematics / Theoretical computer science / Applied mathematics

CSC373S Lecture 2 • Last time we ended by claiming that a greedy algorithm (lets call it EFT for earliest finishing time) that sorts intervals by their finishing times (ties can be broken arbitrarily) and then accepts “greedily” is an optimal algorithm for the interval selection

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2011-01-20 08:49:33
UPDATE