Information for "Dead-end elimination"

From HandWiki

Basic information

Display titleDead-end elimination
Default sort keyDead-end elimination
Page length (in bytes)10,784
Namespace ID0
Page ID200976
Page content languageen - English
Page content modelwikitext
Indexing by robotsAllowed
Number of redirects to this page0
Counted as a content pageYes
HandWiki item IDNone

Page protection

EditAllow all users (infinite)
MoveAllow all users (infinite)
View the protection log for this page.

Edit history

Page creatorimported>Smart bot editor
Date of page creation14:38, 24 October 2022
Latest editorimported>Smart bot editor
Date of latest edit14:38, 24 October 2022
Total number of edits1
Recent number of edits (within past 90 days)0
Recent number of distinct authors0

Page properties

Transcluded templates (17)

Templates used on this page:

SEO properties

Description

Content

Article description: (description)
This attribute controls the content of the description and og:description elements.
The dead-end elimination algorithm (DEE) is a method for minimizing a function over a discrete set of independent variables. The basic idea is to identify "dead ends", i.e., combinations of variables that are not necessary to define a global minimum because there is always a way of replacing such combination...
Information from Extension:WikiSEO