<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05106979</id>
  <dt>j</dt>
  <an>05106979</an>
  <augroup>
    <au>Witte, E.E.</au>
    <au>Chamberlain, R.D.</au>
    <au>Franklin, M.A.</au>
  </augroup>
  <ti>Parallel Simulated Annealing using Speculative Computation.</ti>
  <so>IEEE Transactions on Parallel and Distributed Systems 02, No.04, 483-494 (1991).</so>
  <py>1991</py>
  <pu>Institute of Electrical and Electronics Engineers (IEEE), New York, NY</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>Index Termsproblem independent algorithm</ut>
    <ut>speculative computation</ut>
    <ut>parallel simulated annealingalgorithm</ut>
    <ut>serial decision sequence</ut>
    <ut>processors</ut>
    <ut>concurrency</ut>
    <ut>hypercube multiprocessor</ut>
    <ut>task assignment problem</ut>
    <ut>parallel algorithms</ut>
    <ut>simulated annealing</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1109/71.97904</li>
  </ligroup>
  <abgroup>
    <ab>Summary: A parallel simulated annealing algorithm that is problem-independent, maintains the serial decision sequence, and obtains speedup which can exceed log/sub 2/P on P processors is discussed. The algorithm achieves parallelism by using the concurrency technique of speculative computation. Implementation of the parallel algorithm on a hypercube multiprocessor and application to a task assignment problem are described. The simulated annealing solutions are shown to be, on average, 28% better than the solutions produced by a random task assignment algorithm and 2% better than the solutions produced by a heuristic.</ab>
    <rv></rv>
  </abgroup>
</item>