Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5245065> ?p ?o }
Showing triples 1 to 26 of
26
with 100 triples per page.
- Q5245065 subject Q6426361.
- Q5245065 subject Q8802913.
- Q5245065 abstract "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 by a better or equivalent one. Then we can refrain from searching such combinations further. Hence, dead-end elimination is a mirror image of dynamic programming, in which "good" combinations are identified and explored further. Although the method itself is general, it has been developed and applied mainly to the problems of predicting and designing the structures of proteins. It closely related to the notion of dominance in optimization also known as substitutability in a Constraint Satisfaction Problem. The original description and proof of the dead-end elimination theorem can be found in .".
- Q5245065 wikiPageWikiLink Q1036748.
- Q5245065 wikiPageWikiLink Q1128023.
- Q5245065 wikiPageWikiLink Q1128326.
- Q5245065 wikiPageWikiLink Q1202245.
- Q5245065 wikiPageWikiLink Q141495.
- Q5245065 wikiPageWikiLink Q15712714.
- Q5245065 wikiPageWikiLink Q187787.
- Q5245065 wikiPageWikiLink Q204785.
- Q5245065 wikiPageWikiLink Q232207.
- Q5245065 wikiPageWikiLink Q380679.
- Q5245065 wikiPageWikiLink Q410814.
- Q5245065 wikiPageWikiLink Q5570875.
- Q5245065 wikiPageWikiLink Q626011.
- Q5245065 wikiPageWikiLink Q6426361.
- Q5245065 wikiPageWikiLink Q7268362.
- Q5245065 wikiPageWikiLink Q8054.
- Q5245065 wikiPageWikiLink Q8066.
- Q5245065 wikiPageWikiLink Q816747.
- Q5245065 wikiPageWikiLink Q8802913.
- Q5245065 wikiPageWikiLink Q899656.
- Q5245065 wikiPageWikiLink Q911907.
- Q5245065 comment "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 by a better or equivalent one. Then we can refrain from searching such combinations further.".
- Q5245065 label "Dead-end elimination".