Hierarchies and complexity results for priority algorithms. - Info and Reading Options

The Open Library:

Priority Algorithms is a model of computation that generalizes on-line computation, attempting to formulate the notion of greedy algorithm. We study questions concerning Priority Algorithms for variants of Job Scheduling. In the first part of the thesis we separate the class of adaptive from the class of greedy and adaptive priority algorithms, which was an early stated open question [5]. We also compare the power of restricted classes of priority algorithms defined for the Job Scheduling and we define a memory hierarchy and show that it is robust. The second part studies questions, where given a finite set of jobs, we want to decide whether a given priority algorithm is optimal, or whether there exists, an optimal priority algorithm. For different settings of these questions we derive containment and hardness results for several complexity classes. Finally, We give an NL-completeness result for a variation of Interval Scheduling.

Search for “Hierarchies and complexity results for priority algorithms.” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Hierarchies and complexity results for priority algorithms.” in Libraries Near You:

Read or borrow “Hierarchies and complexity results for priority algorithms.” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Hierarchies and complexity results for priority algorithms.” at a library near you.