Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Optimal Schedules for Parallelizing Anytime Algorithms: The Case of
  Shared Resources   The performance of anytime algorithms can be improved by simultaneously
solving several instances of algorithm-problem pairs. These pairs may include
different instances of a problem (such as starting from a different initial
state), different algorithms (if several alternatives exist), or several runs
of the same algorithm (for non-deterministic algorithms). In this paper we
present a methodology for designing an optimal scheduling policy based on the
statistical characteristics of the algorithms involved. We formally analyze the
case where the processes share resources (a single-processor model), and
provide an algorithm for optimal scheduling. We analyze, theoretically and
empirically, the behavior of our scheduling algorithm for various distribution
types. Finally, we present empirical results of applying our scheduling
algorithm to the Latin Square problem.

31
The categories of this paper are: ao-sci
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph
25
The categories of this paper are: patt-sol
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
30
The categories of this paper are: q-alg
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
28
The categories of this paper are: alg-geom
4
The categories of this paper are: cond-mat
3
The categories of this paper are: physics