The Compset algorithm for subset selection

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 728-733

  Hamo, Yaniv ^a   Markovitch, Shaul ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEMENTARY SETS; LOCAL SEARCH ALGORITHM; MULTIDIMENSIONAL KNAPSACK; ORDERS OF MAGNITUDE; STOCHASTIC HILL-CLIMBING; SUBSET SELECTION; TABU SEARCH ALGORITHMS; VERTEX COVER PROBLEMS;

ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS;

SET THEORY;

EID: 77954607124     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Baluja. An empirical comparison of seven iterative and evolutionary function optimization heuristics. Technical Report CMU-CS-95-193, School of Computer Science, CMU, 1995.
2. J. E. Beasley. OR-library: a collection of test data sets. Technical report, Management School, Imperial College, London, 1997.
3. P. Cheeseman, B. Kanefsky, and W. M. Taylor. Where the really hard problems are. In Proceedings of IJCAI-91, pages 331-336, 1991.
4. DIMACS. Challenge problems for maximum clique, dimacs.rutgers.edu., 1993.
5. O. Etzioni and R. Etzioni. Statistical methods for analyzing speedup learning experiments. Machine Learning, 14(1):333-347, 1994.
6. Isaac K. Evans. Evolutionary algorithms for vertex cover. In V. W. Porto, N. Saravanan, D. Waagen, and A. E. Eiben, editors, Evolutionary Programming VII, pages 377-386, 1998.
7. J. Frank, P. Cheeseman, and J. Stutz. When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7:249-281, 1997.
8. Ian P. Gent and Toby Walsh. Towards an understanding of hill-climbing procedures for SAT. In National Conference on AI, pages 28-33, 1993.
9. F. Glover and M. Laguna. Tabu search. In C. Reeves, editor, Modern Heuristic Techniques for Combinatorial Problems, 1993.
10. Holger H. Hoos and Thomas Stützle. SATLIB: An Online Resource for Research on SAT. In SAT20000: Highlights of Satisfiability Research in the year 2000, pages 283-292. 2000.
11. Holger H. Hoos and Thomas Stützle. Stochastic Local Search - Foundations and Applications. Morgan Kaufman Publishers, 2005.
12. S. Khuri and T. Bäck. An evolutionary heuristic for the minimum vertex cover problem. In Genetic Algorithms within the Framework of Evolutionary Computation, pages 86-90, 1994.
13. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220, 4598:671-680, 1983.
14. M. Mitchell, J. H. Holland, and S. Forrest. When will a genetic algorithm outperform hill climbing. In Advances in NIPS, volume 6, pages 51-58, 1994.