Katalog der Deutschen Nationalbibliothek

Neuigkeiten

Leichte Bedienung, intuitive Suche: Die Betaversion unseres neuen Katalogs ist online! → Zur Betaversion des neuen DNB-Katalogs

 
 
 


Ergebnis der Suche nach: tit all "Randomized algorithms"
im Bestand: Gesamter Bestand

81 - 90 von 161
<< < > >>


Artikel 81 Randomized Algorithms for Robust Stability and Guaranteed Cost Control of Stochastic Jump Parameter Systems with Uncertain Switching Policies
Enthalten in Journal of optimization theory and applications Bd. 124, Nr. 1, date:1.2005: 227-245
Online Ressource
Artikel 82 Randomized And Parallel Algorithms For Distance Matrix Calculations In Multiple Sequence Alignment
Enthalten in Journal of clinical monitoring and computing Bd. 19, Nr. 4-5, date:10.2005: 351-359
Online Ressource
Artikel 83 Randomized registers and iterative algorithms
Enthalten in Distributed computing Bd. 17, Nr. 3, date:03.2005: 209-221
Online Ressource
Online Ressourcen 84 Primality Testing in Polynomial Time
Dietzfelbinger, Martin. - Berlin, Heidelberg : Springer Berlin Heidelberg, 2004
Online Ressource
Bücher 85 Primality testing in polynomial time
Dietzfelbinger, Martin. - Berlin : Springer, 2004
Vorhanden in Leipzig Vorhanden in Frankfurt
Bücher 86 Randomized local search, evolutionary algorithms and the minimum spanning tree problem
Neumann, Frank. - Dortmund : Secretary of the SFB 531, 2004
Vorhanden in Leipzig Vorhanden in Frankfurt
Online Ressourcen 87 Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Neumann, Frank. - Dortmund : Universitätsbibliothek Dortmund, 2004
Online Ressource
Online Ressourcen 88 Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251)
Bampis, Evripidis. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2003
Online Ressource
Artikel 89 Optimal Convergence Rate of the Randomized Algorithms of Stochastic Approximation in Arbitrary Noise
Enthalten in Automation and remote control Bd. 64, Nr. 2, date:2.2003: 252-262
Online Ressource
Artikel 90 Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms
Enthalten in Journal of scheduling Bd. 6, Nr. 2, date:3.2003: 113-129
Online Ressource


81 - 90 von 161
<< < > >>


E-Mail-IconAdministration