Search Results - Nonnumerical Algorithms AND Problems—Sequenc- ing AND scheduling General Terms Algorithms~
-
1
Authors: et al.
Contributors: et al.
Subject Terms: Categories and Subject Descriptors D.1.3 [Programming Techniques, Concurrent Program- ming, F.2.2 [Analysis of Algorithms and Problem Com- plexity, Nonnumerical Algorithms and Problems—Sequenc- ing and scheduling General Terms Algorithms, Theory Keywords Software transactional memory, Transactions, Contention
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: http://catt.poly.edu/~panwar/publications/Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service.pdf.
Subject Terms: Categories and Subject Descriptors, C.2.1 [Computer Communications Networks, Network Architecture and Design, D.4.8 [Operating Systems, Performance-queuing theory, stochastic analysis, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems-sequenc- ing and scheduling, G.m [Discrete Mathematics, Miscellaneous-queuing theory General Terms, Design, Performance, Theory, Verification Additional Key Words and Phrases, Control of Queues, Markov decision processes, packetized voice communications, queues with impatient customers, stochastic scheduling theory
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.8478; http://catt.poly.edu/~panwar/publications/Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service.pdf
Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.470.8478
http://catt.poly.edu/~panwar/publications/Optimal Scheduling Policies for a Class of Queues with Customer Deadlines to the Beginning of Service.pdf
Nájsť tento článok vo Web of Science