Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain

Author： Blum A.  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.26, Iss.1, 1997-01, pp. : 5-23

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems

By Maheswaran R.   Ponnambalam S.G.   Jawahar N.  

International Journal of Intelligent Systems Technologies and Applications, Vol. 4, Iss. 1-2, 2007-12 ,pp. : 34-56

Inderscience Publishers

Access to resources Recommend Favorite

By  

JOURNAL OF THE ASSOCIATION FOR INFORMATION SCIENCE AND TECHNOLOGY, Vol. 66, Iss. 9, 2015-09 ,pp. : 1776-1784

John Wiley & Sons Inc

Access to resources Recommend Favorite

Learning Binary Relations Using Weighted Majority Voting

By Goldman S.A.  

Machine Learning, Vol. 20, Iss. 3, 1995-09 ,pp. : 245-271

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Scheduling with Reservations

By Diedrich Florian   Jansen Klaus   Pascual Fanny   Trystram Denis  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 391-404

Springer Publishing Company

Access to resources Recommend Favorite

Robust Algorithms for Preemptive Scheduling

By Epstein Leah   Levin Asaf  

Algorithmica, Vol. 69, Iss. 1, 2014-05 ,pp. : 26-57

Springer Publishing Company

Access to resources Recommend Favorite