Jump to content

Wikipedia:Articles for deletion/Raita algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Djm-leighpark (talk | contribs) at 13:03, 26 November 2019 (k). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Raita algorithm (edit | talk | history | protect | delete | links | watch | logs | views) – (View log · Stats)
(Find sources: Google (books · news · scholar · free images · WP refs· FENS · JSTOR · TWL)

The tuning only goes into the comparison loop, something already covered by BMH's inter-implementation variations. (I actually *had* to do it for BMH to account for the variations in implementations.) Artoria2e5 🌉 11:50, 22 November 2019 (UTC)[reply]

Note: This discussion has been included in the list of Computing-related deletion discussions. Artoria2e5 🌉 11:50, 22 November 2019 (UTC)[reply]
  • Comment I’m not sure what the nominator means but I don’t see a delete rationale here. Mccapra (talk) 11:58, 22 November 2019 (UTC)[reply]
  • Keep: Longer term maybe merge/redirect or maybe Wikibooks .. ie it sems credible alternatives to deletions exist, but we shouldn't persue them in in such a way to disrupt the target. If we can source and execute a non disruptive merge or target anchor area improvement+redirect(W History) with non disruptive mention and description of target then I'd be up for than but we are sort of relying on noms. opinion here (which I confess way well be correct).Djm-leighpark (talk) 13:02, 26 November 2019 (UTC)[reply]