Katalog der Deutschen Nationalbibliothek

Expertensuche ?

Servicezeiten in Frankfurt am Main ab 1. Dezember 2025: Montag bis Freitag 9–18 Uhr und Samstag 10–16 Uhr
Service hours in Frankfurt am Main from 1 December 2025: Monday to Friday 9:00-18:00 and Saturday 10:00-16:00

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

24. Dezember 2025 bis 1. Januar 2026: Die Deutsche Nationalbibliothek bleibt an beiden Standorten geschlossen. // 24 December 2025 to 1 January 2026: The German National Library will be closed at both locations.

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

91 - 100 von 165

	91	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
	92	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
	93	Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231) Dyer, Martin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2002
	94	Randomized pivot algorithms for P-matrix linear complementarity problems Enthalten in Mathematical programming Bd. 92, Nr. 2, date:4.2002: 285-296
	95	Randomized Algorithms for Stochastic Approximation under Arbitrary Disturbances Enthalten in Automation and remote control Bd. 63, Nr. 2, date:2.2002: 209-219
	96	Optimal Parallel Randomized Algorithms for the Voronoi Diagram of Line Segments in the Plane Enthalten in Algorithmica Bd. 33, Nr. 4, date:08.2002: 436-460
	97	Optimal summation and integration by deterministic, randomized and quantum algorithms Heinrich, Stefan. - Kaiserslautern : Fachbereich Informatik, Univ., 2001
	98	RAND APX Workshop on Approximation Intractability joint with the Workshop Design and Analysis of Randomized and Approximation Algorithms RAND APX Workshop on Approximation Intractability (2001 : Dagstuhl). - Bonn : Inst. für Informatik, 2001
	99	Randomized algorithms Bubley, Russ. - London : Springer, 2001
	100	Randomized Algorithms: Approximation, Generation and Counting London : Springer London, 2001