Skip to search formSkip to main contentSkip to account menu

Dead-end elimination

Known as: Dead end elimination, Dee 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
Knowledge of genetic relationships in crop breeding programs provides valuable information that can be used by plant breeders as… 
2004
2004
ionn faite de des/du 'partitif, que nous avons mis de cöté dans Iee debat , Ie statut des GN en des et du s'est avéré double : d… 
2002
2002
We employ an arrangement of polarization analyzer loops to derive several simple Bell inequalities and then discuss the violation… 
2000
2000
A comparison is made of several autonomous software architectures for multiple satellite systems. Multiple, agent-based satellite… 
1998
1998
ix Acknowledgments I am very grateful to my supervisors, Remko Scha, Peter van Emde Boas and Bipin Indurkhya, for their… 
Highly Cited
1988
Highly Cited
1988
Modele mathematique pour etudier l'evolution de la forme des tranchees au cours de la gravure assistee par plasma 
1982
1982
W opraciu o bezpośrednie obserwacje i wizualne znakowanie, w latach 1969-1971 i 1972-1976, na terenie doświadczalnym Stacji… 
1979
1979
The latest in a series of internal-ring devices, called Tokapole II, has recently begun operation at the University of Wisconsin… 
1977
1977
JEDLINSKI, H., W. F. ROCHOW, and C. M. BROWN. 1977. Tolerance to barley yellow dwarf virus in oats. Phytopathology 67: 1408-1411… 
1976
1976
Fleas obtained from deer mice and each of three sympatric rodents collected at the same times and places are quantified. When…