Global ETD Search

1	CRITICAL VALUES: FEMINIST PHILOSOPHY OF SCIENCE AND THE COMPUTING SCIENCES SHERRON, CATHERINE ELIZABETH 01 July 2003 (has links) No description available. Philosophy feminist philosophy of science computing and artificial intelligence epistemology feminist epistemology philosophy of science
2	Analyse von Translationsstarts in prokaryotischen Genomen mit Methoden des Maschinellen Lernens / Analysis of translation initiation sites in prokaryotic genomes with machnine learning methods Tech, Maike 02 November 2007 (has links) No description available. 570 Biowissenschaften, Biologie Mathematics and Computer Science Bioinformatik Maschinelles Lernen Prokaryoten Translationsstarts bioinformatics machine learning prokaryots translation inititiation sites 42.11 Biomathematik 54.80 Angewandte Informatik WD 500: Bioinformatik {Biologie}
3	On the Value of Prediction and Feedback for Online Decision Making With Switching Costs Ming Shi (12621637) 01 June 2022 (has links) <p>Online decision making with switching costs has received considerable attention in many practical problems that face uncertainty in the inputs and key problem parameters. Because of the switching costs that penalize the change of decisions, making good online decisions under such uncertainty is known to be extremely challenging. This thesis aims at providing new online algorithms with strong performance guarantees to address this challenge.</p> <p><br></p> <p>In part 1 and part 2 of this thesis, motivated by Network Functions Virtualization and smart grid, we study competitive online convex optimization with switching costs. Specifically, in part 1, we focus on the setting with an uncertainty set (one type of prediction) and hard infeasibility constraints. We develop new online algorithms that can attain optimized competitive ratios, while ensuring feasibility at all times. Moreover, we design a robustification procedure that helps these algorithms obtain good average-case performance simultaneously. In part 2, we focus on the setting with look-ahead (another type of prediction). We provide the first algorithm that attains a competitive ratio that not only decreases to 1 as the look-ahead window size increases, but also remains upper-bounded for any ratio between the switching-cost coefficient and service-cost coefficient.</p> <p><br></p> <p>In part 3 of this thesis, motivated by edge computing with artificial intelligence, we study bandit learning with switching costs where, in addition to bandit feedback, full feedback can be requested at a cost. We show that, when only 1 arm can be chosen at a time, adding costly full-feedback is not helpful in fundamentally reducing the Θ(<em>T</em>2/3) regret over a time-horizon <em>T</em>. In contrast, when 2 (or more) arms can be chosen at a time, we provide a new online learning algorithm that achieves a significantly smaller regret equal to <em>O</em>(√<em>T</em>), without even using full feedback. To the best of our knowledge, this type of sharp transition from choosing 1 arm to choosing 2 (or more) arms has never been reported in the literature.</p> Network engineering bandit learning switching costs regret analysis online convex optimization competitive analysis look-ahead regularization competitive online algorithms Network Functions Virtualization ramp constraints robustification
4	An Active Domain Node Architecture for the Semantic Web / Eine Knotenarchitektur mit aktivem Verhalten für das Semantic Web Schenk, Franz 21 November 2008 (has links) No description available. 004 Informatik Mathematics and Computer Science Wissensmanagement OWL Semantic Web Beschreibungslogik Hybrides automatisches Beweisen Semantic Web Event-Driven Architecture OWL Active Knowledge Base Intensional Updates Hybrid Reasoning Description Logic F-Logic 54.64 54.71 54.72
5	Learning Finite State Machine Specifications from Test Cases / Lernen von Spezifikationen in Form von endlichen Zustandsmaschinen aus Testfällen Werner, Edith Benedicta Maria 01 June 2010 (has links) No description available. 004 Informatik Mathematics and Computer Science Maschinelles Lernen Modellrekonstruktion Modell-basiertes Testen Test-Validierung machine learning reverse engineering model based testing test validation 54.52 54.72 54.10
6	Modellierung dynamischer Prozesse mit radialen Basisfunktionen / Modeling of dynamical processes using radial basis functions Dittmar, Jörg 20 August 2010 (has links) No description available. 530 Physik Physics Modellierung Black-Box-Modell statistische Lerntheorie Termselektion dynamische Systeme Parameterabhängigkeit Bifurkationsdiagramm Attraktor-Diskrepanz radiale Basisfunktionen RBF Modeling black-box model statistical learning theory subset selection dynamical systems parameter dependence bifurcation diagram attractor discrepancy radial basis functions RBF 33.06 30.20
7	Local- and Cluster Weighted Modeling for Prediction and State Estimation of Nonlinear Dynamical Systems / Lokale- und Cluster-Weighted-Modellierung zur Vorhersage und Zustandsschätzung nichtlinearer dynamischer Systeme Engster, David 24 August 2010 (has links) No description available. 530 Physik Physics Modellierung Black-Box-Modellierung Cluster-Weighted-Modelle Lokale Modelle Nächste-Nachbar-Methoden Aktives Lernen Maschinelles Lernen Probabilistische Scores Modeling Black-Box-Modeling Clustering Cluster-Weighted-Models Local Modeling Nearest-Neighbor-Methods Active Learning Machine Learning Probabilistic Scores 30.20 33.06

1

Page generated in 0.1521 seconds