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
2014
Highly Cited
2014
This paper addresses the challenge of establishing a bridge between deep convolutional neural networks and conventional object… 
Review
2009
Review
2009
For decades, researchers have been applying computer simulation to address problems in biology. However, many of these "grand… 
Highly Cited
2007
Highly Cited
2007
Pervasive and networked computers have dramatically reduced the cost of collecting and distributing large datasets. In this… 
Highly Cited
2003
Highly Cited
2001
Highly Cited
2001
The sequence database is a set of data sequences, each of which is an ordered list of elements [1]. Sequences of stock prices… 
Review
1997
Review
1997
We consider the problem of mining association rules over interval data (that is, ordered data for which the separation between… 
Review
1994
Review
1994
From the Publisher: A New York Times bestseller when it appeared in 1989, Roger Penrose's The Emperor's New Mind was universally… 
Highly Cited
1978
Highly Cited
1978
Describes the physical characteristics, usages, and probable functions of 11 vocali- zations of adult Black-capped Chickadees and… 
Highly Cited
1949
Highly Cited
1949
By obtaining complete solutions, satisfying all the relevant simultaneous differential equations and boundary conditions… 
Highly Cited
1932
Highly Cited
1932
The experiments reported in this paper are part of a study of the conditions which affect the reproduction of visually perceived…