no seriously the first hit is a paper with an algorithm
(by “split” I mean “find overlapping intervals and move instructions around to make them non overlapping if possible”)
-
-
okay so if i understand here right... you suspect the best way to do this is basically to *try to come up with the schedule*? that is, there's no way to do it from graph analysis, you basically just have to do the whole actual scheduling process
-
Dunno. There might well be a smarter way to do it. Seems hard because of complex interactions between scheduling and the interference graph
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.