Learning techniques for automatic algorithm portfolio selection

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 475-479

  Guerri, Alessio ^a   Milano, Michela ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT PROGRAMMING; CONSTRAINT THEORY; DECISION TREES; LEARNING ALGORITHMS; LEARNING SYSTEMS;

ALGORITHM PORTFOLIOS; AUTOMATIC ALGORITHMS; BID EVALUATION; CASE-STUDIES; COMBINATORIAL AUCTION; CONSTRAINT PROGRAMMING; EVALUATION PROBLEMS; LEARNING TECHNIQUES; MACHINE LEARNING TECHNIQUES; PORTFOLIO SELECTION;

INTEGER PROGRAMMING;

EID: 85017348041     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. R. Bejar, A. Cabiscol, C. Fernuandez, C.P. Gomes and F. Manyua, Capturing Structure with Satisfiability, Proc. CP-2001, pp. 137-152, 2001.
2. J. Collins and M. Gini, An integer programming for- mulation of the bid evaluation problem for coordi- nated tasks, Mathematics of the Internet: E-Auction and Markets; Vol.127, pp. 59-74, 2001.
3. M. L. Ginsberg and W. D. Harvey. Limited Discrepancy Search. Proc. IJCAI-95; Vol. 1, pp. 607-615, 1995.
4. C.P. Gomes and B. Selman, Algorithm portfolio design: theory vs. practice, Proc. UAI-97, pp. 190-197, 1997.
5. C.P. Gomes and B. Selman, Problem Structure in the Presence of Perturbations, Proc. AAAI-97, pp. 221-226, 1997.
6. A. Guerri and M. Milano, CP-IP techniques for the Bid Evaluation in Combinatorial Auctions, Proc. CP-2003, pp. 863-867, 2003.
7. K. Leyton-Brown, M. Pearson and Y. Shoham, Towards an Universal Test Suite for Combinatorial Auction Al- gorithms, Proc. EC-00, pp. 66-76, 2000.
8. K. Leyton-Brown, E. Nudelman and Y. Shoham, Learn- ing the Empirical Hardness of Optimization Problems: The Case of Combinaorial Auctions, Proc CP-2002, pp. 556-572, 2002.
9. K. Leyton-Brown, E. Nudelman, G. Andrew, J. McFadden, Y. Shoham, Boosting as a Metaphor for Algorithm Design, Proc. CP-2003, pp. 899-903, 2003.
10. J. C. Regin, Generalized Arc Consistency for Global Cardinality constraint, in Proc. AAAI-96; Vol. 1, pp. 209-215, 1996.
11. J. Ross Quinlan, C4.5: programs for machine learning, Margan Kaufmann, 1993.
12. T. Walsh, Search in a Small World, Proc. IJCAI-99, pp. 1172-1177, 1999.
13. T.Walsh, Search on High Degree Graphs, Proc. IJCAI- 2001, pp. 226-274, 2001.
14. C. Williams and T. Hogg, Exploiting the deep structure of constraint problems, Artificial Intelligence, Vol. 70, pp. 72-117, 1994.