Learning Techniques for Automatic Algorithm Portfolio Selection
暂无分享,去创建一个
[1] Maria Gini,et al. An integer programming formulation of the bid evaluation problem for coordinated tasks , 2002 .
[2] J. Ross Quinlan,et al. C4.5: Programs for Machine Learning , 1992 .
[3] Y. Shoham,et al. Towards a Universal Test Suite forCombinatorial Au tion , 2000 .
[4] Michela Milano,et al. CP-IP Techniques for the Bid Evaluation in Combinatorial Auctions , 2003, CP.
[5] Tad Hogg,et al. Exploiting the Deep Structure of Constraint Problems , 1994, Artif. Intell..
[6] Yoav Shoham,et al. Boosting as a Metaphor for Algorithm Design , 2003, CP.
[7] Toby Walsh,et al. Search on High Degree Graphs , 2001, IJCAI.
[8] Toby Walsh,et al. Search in a Small World , 1999, IJCAI.
[9] Ramón Béjar,et al. Capturing Structure with Satisfiability , 2001, CP.
[10] Yoav Shoham,et al. Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions , 2002, CP.
[11] Bart Selman,et al. Algorithm Portfolio Design: Theory vs. Practice , 1997, UAI.
[12] Matthew L. Ginsberg,et al. Limited Discrepancy Search , 1995, IJCAI.
[13] Jean-Charles Régin,et al. Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.
[14] Bart Selman,et al. Problem Structure in the Presence of Perturbations , 1997, AAAI/IAAI.