Probabilistic models for covering algorithms

MaRDI QIDQ3610929zbMATH OpenFDO

Authors Ling Zhang, Tao Wu, Ying Zhou, YanPing Zhang

Publication date 6 March 2009

zbMATH Keywords

covering algorithmfinite mixture probabilistic modelmachine learningneural network

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 1132808
• scientific article; zbMATH DE number 92255
• Application of probability methods to the problem of construction of optimal coverings
• The Probabilistic Set-Covering Problem
• scientific article; zbMATH DE number 4023016

Cited in

(4)

• Occupancy urn models in the analysis of algorithms
• Probabilistic analysis of a bin covering algorithm
• A statistical approach to covering lemmas
• Path optimization algorithms for covering learning

This page was built for publication: Probabilistic models for covering algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3610929)