APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM (Q2997925): Difference between revisions

@@ Property / author @@
-Denis Trystram
@@ Property / author: Denis Trystram / rank @@
-Normal rank
@@ Property / author @@
+Denis Trystram
@@ Property / author: Denis Trystram / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+SatEx
@@ Property / describes a project that uses: SatEx / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / cites work @@
+On the influence of lookahead in competitive paging algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm portfolios
@@ Property / cites work: Algorithm portfolios / rank @@
+Normal rank
@@ Property / cites work @@
+A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
+Normal rank
@@ Property / cites work @@
+Asynchronous teams: cooperation schemes for autonomous agents
+Normal rank
@@ Property / cites work @@
+PYTHIA
@@ Property / cites work: PYTHIA / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2997925