1,334 results on '"A. Marchetti Spaccamela"'
Search Results
52. Total completion time scheduling under scenarios
53. Flow Time Minimization
54. Performance improvements for search systems using an integrated cache of lists + intersections
55. Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines.
56. Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections.
57. Scheduling over Scenarios on Two Machines.
58. Performance Improvements for Search Systems Using an Integrated Cache of Lists+Intersections
59. Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
60. Polynomial-Time Exact Schedulability Tests for Harmonic Real-Time Tasks.
61. Feasibility Analysis in the Sporadic DAG Task Model.
62. Algorithms for Secure Communication
63. Assigning Sporadic Tasks to Unrelated Parallel Machines.
64. A Generalized Parallel Task Model for Recurrent Real-time Processes.
65. The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems.
66. Assigning Sporadic Tasks to Unrelated Parallel Machines
67. The Safe and Effective Use of Low-Assurance Predictions in Safety-Critical Systems
68. Mixed-Criticality Scheduling of Sporadic Task Systems.
69. Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks.
70. Structures and Hyperstructures in Metabolic Networks.
71. Structures and Hyperstructures in Metabolic Networks
72. Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
73. Mixed-Criticality Scheduling of Sporadic Task Systems
74. Universal Sequencing on a Single Machine.
75. Feasibility Analysis of Sporadic Real-Time Multiprocessor Task Systems.
76. Scheduling Real-Time Mixed-Criticality Jobs.
77. Algorithms and Complexity for Periodic Real-Time Scheduling.
78. Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms.
79. Data Gathering in Wireless Networks
80. Enumerating Chemical Organisations in Consistent Metabolic Networks: Complexity and Algorithms
81. Scheduling Real-Time Mixed-Criticality Jobs
82. Universal Sequencing on a Single Machine
83. Strong LP formulations for scheduling splittable jobs on unrelated machines.
84. Assigning sporadic tasks to unrelated machines.
85. Preemptive Uniprocessor Scheduling of Mixed-Criticality Sporadic Task Systems.
86. Approximation Preserving Reductions
87. Approximation through Randomization
88. Probabilistic analysis of approximation algorithms
89. The PCP theorem
90. Input-Dependent and Asymptotic Approximation
91. NP, PCP and Non-approximability Results
92. Approximation Classes
93. Heuristic methods
94. Design Techniques for Approximation Algorithms
95. The Complexity of Optimization Problems
96. Nonclairvoyant Speed Scaling for Flow and Energy.
97. On the complexity of the regenerator placement problem in optical networks.
98. Implementation of a Speedup-Optimal Global EDF Schedulability Test.
99. Approximation Algorithms for Replenishment Problems with Fixed Turnover Times
100. Minimizing Flow Time in the Wireless Gathering Problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.