Add to ORKGThis paper presents a cost error measurement scheme and relaxed synchronization method, for simulated annealing on a distributed memory multicomputer, which predicts the amount of cost error that an algorithm will tolerate. An adaptive error control method is developed and implemented on an Intel iPSC/
Variation in performance and power across manufactured parts and their operating conditions is an ac...
Journal ArticleA variation of the Time Warp parallel discrete event simulation mechanism is presente...
We have studied two related issues in the design, execution and debugging of shared memory parallel ...
Simulated annealing is an attractive, but expensive, heuristic for approximating the solution to com...
In parallelizing simulated annealing in a multicomputer, maintaining the global state S involves exp...
Reducing synchronization constraints in parallel simulated annealing algorithms can improve performa...
Simulated annealing has proven to be a good technique for solving hard combinatorial optimization p...
A common approach to parallelizing simulated annealing to generate several perturbations to the cur...
This thesis describes a new, efficient, and general purpose parallel simulated annealing algorithm....
Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its ...
Simulated annealing (SA) is a stochastic optimization technique which guarantees under certain condi...
Recent increases in hard fault rates in modern chip multi-processors have led to a variety of approa...
The design and implementation of a reliable version of the distributed bitonic sorting algorithm usi...
A distributed system is a group of processors that do not allocate memory. As an alternative, each p...
Stochastische globale Optimierung ist ein wichtiges mathematisches Verfahren für das Er- mitteln von...
Variation in performance and power across manufactured parts and their operating conditions is an ac...
Journal ArticleA variation of the Time Warp parallel discrete event simulation mechanism is presente...
We have studied two related issues in the design, execution and debugging of shared memory parallel ...
Simulated annealing is an attractive, but expensive, heuristic for approximating the solution to com...
In parallelizing simulated annealing in a multicomputer, maintaining the global state S involves exp...
Reducing synchronization constraints in parallel simulated annealing algorithms can improve performa...
Simulated annealing has proven to be a good technique for solving hard combinatorial optimization p...
A common approach to parallelizing simulated annealing to generate several perturbations to the cur...
This thesis describes a new, efficient, and general purpose parallel simulated annealing algorithm....
Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its ...
Simulated annealing (SA) is a stochastic optimization technique which guarantees under certain condi...
Recent increases in hard fault rates in modern chip multi-processors have led to a variety of approa...
The design and implementation of a reliable version of the distributed bitonic sorting algorithm usi...
A distributed system is a group of processors that do not allocate memory. As an alternative, each p...
Stochastische globale Optimierung ist ein wichtiges mathematisches Verfahren für das Er- mitteln von...
Variation in performance and power across manufactured parts and their operating conditions is an ac...
Journal ArticleA variation of the Time Warp parallel discrete event simulation mechanism is presente...
We have studied two related issues in the design, execution and debugging of shared memory parallel ...