๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some algorithms for solving the covering problem, and their experimental study on a computer

โœ Scribed by O.G. Alekseev; V.F. Grigor'ev

Publisher
Elsevier Science
Year
1984
Weight
413 KB
Volume
24
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for solving a spatial optimis
Algorithms for solving a spatial optimisation problem on a parallel computer
โœ George, Felicity; Radcliffe, Nicholas; Smith, Mark; Birkin, Mark; Clarke, Martin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 337 KB ๐Ÿ‘ 2 views

In a collaborative project between GMAP Ltd and EPCC, an existing heuristic optimisation scheme for strategic resource planning was parallelised to run on the data parallel Connection Machine CM-200. The parallel software was found to run over 2700 times faster than the original workstation software