Parallel random search and tabu search for the minimal consistent subset selection problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1518, Issue , 1998, Pages 248-259

  Cerverón, Vicente ^a   Fuertes, Ariadna ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; RANDOM PROCESSES;

APPROXIMATION TECHNIQUES; DISCRETE OPTIMIZATION PROBLEMS; META HEURISTICS; MINIMAL CONSISTENT SUBSET; PARALLEL TABU SEARCH; PROCESSING TIME; RANDOM SEARCHES; SEARCH STRATEGIES;

TABU SEARCH;

EID: 84958658180     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49543-6_20     Document Type: Conference Paper

References (15)

1. Dasarathy, B.V.: Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. Los Alamitos, CA: IEEE Computer Society Press, 1991
2. Kuncheva, L.I., Bezdek, J.C.: Nearest Prototype Classification: Clustering, Genetic Algorithms, or Random Search?. IEEE Trans. Systems, Man, and Cybernetics, Vol. 28, No. 1, pp. 160-164, Feb., 1998
3. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, 1997
4. Verhoeven, M.G.A., Aarts, E.H.L.: Parallel Local Search. Journal of Heuristics, 1 pp. 43-65, Kluwer Academic Publishers, 1995
5. Hart, P.E.: The condensed nearest neighbor rule. IEEE Trans. Information Theory, vol. IT-14, no. 3, pp. 515-516, May 1968
6. Gates, G.W.: The reduced nearest neighbor rule. IEEE Trans. Information Theory, vol. IT-18, no. 3, pp. 431-433, Nov, 1974
7. Dasarathy, B.V.: Minimal Consistent Set (MCS) Identification for Optimal Neighbor Decision Systems Design. IEEE Trans. Systems, Man, and Cybernetics, Vol. 24, No. 3, pp. 511-517 March 1994
8. Dowsland, K.: Simulated Annealing (in Modern Heuristic Techniques for Combinatorial Problems). Ed. C.R.Reeves, Blackwell Scientific Pub., Oxford, 1993
9. Dowsland, K.: Genetic Algorithms. A tool for OR. JORS, vol. 47, pp 550-561,1996
10. Glover, F., Taillard, E., De Werra, D.: A user's guide to tabu search. Annals of Operations Research, 41, pp. 3-28, 1993
11. Abdelrahman, T.S.: Performance of Parallel Branch and Bound Algorithms on the KSR1 Multiprocessor. Departament of Electrical and Computer Engineering, The University of Toronto, 1993
12. Kumar, V., Grama, A.: Search Algorithms for Discrete Optimization Problems (in Introduction to Parallel Computing). The Benjanün/Qimmings Publishing Co., 1994
13. Porto, S.C.S., Ribeiro, S.C.S.: Parallel Tabu Search Message-Passing Synchronous Strategies for Task Scheduling Under Precedence Constraints. Journal of Heuristics, 1 pp. 207-223, Kluwer Academic Publishers, 1995
14. Niar, S., Freville, A.: A Parallel Tabu Search Algorithm For the 0-1 Multidimensional Knapsack Problem. International Parallel Processing Symposium, April 1997
15. Levine, D.: A Parallel Genetic Algorithm for the Set Partitioning Problem. Ph.D. thesis, Illinois Institute of Technology, 1994