Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Versand:
EUR 3,74
Innerhalb der USA
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020199820
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9783639474190_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung PF. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783639474190
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9783639474190
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -We approach the knapsack problem from a statistical learning perspective. We consider a stochastic setting with uncertainty about the description of the problem instances. As a consequence, uncertainty about the optimal solution arises. We present a characterization of different classes of knapsack problem instances based on their sensitivity to noise variations. We do so by calculating the informativeness as measured by the approximation set coding (ASC) principle. We also demonstrate experimentally that, depending on the problem instance class, the ability to reliably localize good knapsack solution sets may or may not be a requirement for good generalization performance. Furthermore, we present a parametrization of knapsack solutions based on the concept of a knapsack core. We show that this parametrization allows to regularize the model complexity of the knapsack learning problem. Algorithms based on the core concept may benefit from this parametrization to achieve better generalization performance at reduced running times. Finally, we consider a randomized approximation scheme for the counting knapsack problem proposed by Dyer. We employ the ASC principle to determine the maximally informative approximation ratio. 88 pp. Englisch. Bestandsnummer des Verkäufers 9783639474190
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - We approach the knapsack problem from a statistical learning perspective. We consider a stochastic setting with uncertainty about the description of the problem instances. As a consequence, uncertainty about the optimal solution arises. We present a characterization of different classes of knapsack problem instances based on their sensitivity to noise variations. We do so by calculating the informativeness as measured by the approximation set coding (ASC) principle. We also demonstrate experimentally that, depending on the problem instance class, the ability to reliably localize good knapsack solution sets may or may not be a requirement for good generalization performance. Furthermore, we present a parametrization of knapsack solutions based on the concept of a knapsack core. We show that this parametrization allows to regularize the model complexity of the knapsack learning problem. Algorithms based on the core concept may benefit from this parametrization to achieve better generalization performance at reduced running times. Finally, we consider a randomized approximation scheme for the counting knapsack problem proposed by Dyer. We employ the ASC principle to determine the maximally informative approximation ratio. Bestandsnummer des Verkäufers 9783639474190
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung PAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bestandsnummer des Verkäufers L0-9783639474190
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Buchbeschreibung Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Stelling Simonwas 25 years old when he attained his master s degree in computer science at ETH Zuerich. He currently works as a software engineer at Ergon Informatik.We approach the knapsack problem from a statistical learning per. Bestandsnummer des Verkäufers 4991274
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren