[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: GLPSOL in webassemby faster than native ?
|
From: |
Michael Hennebry |
|
Subject: |
Re: GLPSOL in webassemby faster than native ? |
|
Date: |
Fri, 2 Oct 2020 10:59:26 -0500 (CDT) |
|
User-agent: |
Alpine 2.20 (DEB 67 2015-01-07) |
On Thu, 1 Oct 2020, Domingo Alvarez Duarte wrote:
But in reality it seems that musl/qsort results in "stable sort" but actually
for hashi.mod and tiling.mod the order of the "tie-breaker" results in a lot
shorter solving time.
Note that you have achieved consistency of result,
not necessarily consistently better performance.
--
Michael hennebry@web.cs.ndsu.NoDak.edu
"Sorry but your password must contain an uppercase letter, a number,
a haiku, a gang sign, a heiroglyph, and the blood of a virgin."
-- someeecards