<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="M">   <ARLID>0410299</ARLID> <utime>20240103182204.5</utime><mtime>20060210235959.9</mtime>        <title language="eng" primary="1">Randomized algorithms for control and optimization</title> <part_num>14</part_num> <part_title>Control and Complexity</part_title>  <publisher> <place>New York</place> <name>Wiley</name> <pub_time>2000</pub_time> </publisher> <specification> <page_count>14 s.</page_count> </specification>   <serial><title>Automation</title><part_num/><part_title/><page_num>1-14</page_num><editor><name1>Samad</name1><name2>T.</name2></editor><editor><name1>Wayrauch</name1><name2>J.</name2></editor></serial>   <author primary="1"> <ARLID>cav_un_auth*0101146</ARLID> <name1>Kulhavý</name1> <name2>Rudolf</name2> <institution>UTIA-B</institution>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>     <COSATI>09I</COSATI>    <cas_special> <research> <research_id>AV0Z1075907</research_id> </research>  <abstract language="eng" primary="1">The chapter discusses how randomized algorithms can contribute to solution of computationally hard problems in control and optimization. A special attention is paid to Markov Chain Monte Carlo statistical methods, stochastic optimization and ordinal optimization.</abstract>      <RIV>BC</RIV>   <department>AS</department>    <permalink>http://hdl.handle.net/11104/0130390</permalink>   <ID_orig>UTIA-B 20000015</ID_orig>     <arlyear>2000</arlyear>       <unknown tag="mrcbU10"> 2000 </unknown> <unknown tag="mrcbU10"> New York Wiley </unknown> <unknown tag="mrcbU63"> Automation 1 14 </unknown> <unknown tag="mrcbU67"> Samad T. 340 </unknown> <unknown tag="mrcbU67"> Wayrauch J. 340 </unknown> </cas_special> </bibitem>