¼±Åà - È­»ìǥŰ/¿£ÅÍŰ ´Ý±â - ESC

 
"successive"¿¡ ´ëÇÑ ¼¼ºÎ °Ë»ö °á°úÀÔ´Ï´Ù
KMLE À¥ ¿ë¾î ¸ÂÃã °Ë»ö °á°ú : 3 ÆäÀÌÁö: 1
successive a. shaping.
Ãâó: www.mercksource.com/pp/us/cns/cns_health_library.j...
successive approximation The iterative scheme by which an approximation is used for the basic design of an algorithm. The sequence generated is of the form x^(k+1) = x^k + A(x^k), where A is an algorithm map specified by its approximation to some underlying goal. Typically, this is used to find a fixed point, where A(x)=0 (eg, seeking f(x)=x, let A(x) = f(x) - x, so the iterations are x^(k+1) = f(x^k), converging to x*=f(x*) if f satisfies certain conditions, such as a contraction map).
Ãâó: home.eunet.cz/berka/o/English/lp/glossary/S.html
successive approximation Alternatively known as Successive Approximation Character Weighting (SACW). This is a method of reweighting characters based on some measure of their relative values for the purposes of phylogeny reconstruction. If, for instance, an initial analysis is carried out and the result of this analysis indicates that some characters are quite inconsistent with the resulting tree(s), then these will be down-weighted in subsequent analyses. ...
Ãâó: www.bioinf.org/molsys/glossaryS.html
ÀÌ ¾Æ·¡ ºÎÅÍ´Â °á°ú°¡ ¾ø½À´Ï´Ù.
KMLE À¥ ¿ë¾î À¯»ç °Ë»ö °á°ú : 0 ÆäÀÌÁö: 1
ÅëÇÕ°Ë»ö ¿Ï·á