Počet záznamů: 1
Branch & Bound algorithm with partial prediction for use with recursive and non-recursive criterion forms
SYS 0410760 LBL 00000nam^^22^^^^^^^^450 005 20240103182237.2 010 $a 3-540-41767-2 101 0-
$a eng 102 $a DE 200 1-
$a Branch & Bound algorithm with partial prediction for use with recursive and non-recursive criterion forms 210 $a Heidelberg $c Springer $d 2001 215 $a 10 s. 225 1-
$a Lecture Notes in Computer Science. $v 2013 463 -1
$1 200 1 $a Advances in Pattern Recognition - ICAPR 2001. Proceedings $v s. 425-434 $1 702 1 $a Singh $b S. $4 340 $1 702 1 $a Murshed $b N. $4 340 $1 702 1 $a Kropatsch $b W. $4 340 610 1-
$a branch and bound 610 1-
$a search tree 610 1-
$a optimal subset selection 700 -1
$3 cav_un_auth*0101197 $a Somol $b Petr $p UTIA-B $w Department of Pattern Recognition $4 070 $T Ústav teorie informace a automatizace AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0101182 $a Pudil $b Pavel $p UTIA-B $w Department of Pattern Recognition $4 070 $T Ústav teorie informace a automatizace AV ČR, v. v. i. 701 -1
$3 cav_un_auth*0101091 $a Grim $b Jiří $p UTIA-B $w Department of Pattern Recognition $4 070 $T Ústav teorie informace a automatizace AV ČR, v. v. i. 856 $u http://library.utia.cas.cz/separaty/historie/somol-branch & bound algorithm with partial prediction for use with recursive and non-recursive criterion forms.pdf
Počet záznamů: 1