
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Benjamin W. Wah, Arthur Ieumwananonthachai, LonChan Chu, Akiko N. Aizawa, "GeneticsBased Learning of New Heuristics: Rational Scheduling of Experiments and Generalization," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 763785, October, 1995.  
BibTex  x  
@article{ 10.1109/69.469821, author = {Benjamin W. Wah and Arthur Ieumwananonthachai and LonChan Chu and Akiko N. Aizawa}, title = {GeneticsBased Learning of New Heuristics: Rational Scheduling of Experiments and Generalization}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {5}, issn = {10414347}, year = {1995}, pages = {763785}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.469821}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  GeneticsBased Learning of New Heuristics: Rational Scheduling of Experiments and Generalization IS  5 SN  10414347 SP763 EP785 EPD  763785 A1  Benjamin W. Wah, A1  Arthur Ieumwananonthachai, A1  LonChan Chu, A1  Akiko N. Aizawa, PY  1995 KW  Branchandbound search KW  generalization KW  geneticsbased learning KW  heuristics KW  knowledgelean applications KW  performance evaluation KW  process mapping KW  resource scheduling KW  VLSI circuit testing KW  VLSI placement and routing.. VL  7 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] D.H. Ackley,A Connectionist Machine for Genetic HillClimbing.Boston, Mass.: Kluwer Academic, 1987.
[2] A.K. Aizawa and B.W. Wah,“Scheduling of genetic algorithms in a noisy environment,” Evolutionary Computation, vol. 2, no. 2, pp. 97122, 1994.
[3] A.N. Aizawa and B.W. Wah,“A sequential sampling procedure for genetic algorithms,” Computers and Mathematics with Applications, vol. 27, no. 9/10, pp. 7782, May 1994.
[4] R.E. Bechhofer,“A singlesample multipledecision procedure for ranking means of normal populations with known variances,” Ann. Math. Statist., vol. 25, no. 1, pp. 1639, Mar. 1954.
[5] R.E. Bechhofer,A.J. Hayter,, and A.C. Tamhane,“Designing experiments for selecting the largest normal mean when the variances are known and unequal:Optimal sample size allocation,” J. Statistical Planning and Inference, vol. 28, pp. 271289, 1991.
[6] L.B. Booker,D.E. Goldberg,, and J.H. Holland,“Classifier systems and genetic algorithms,” Machine Learning: Paradigm and Methods, J. Carbonell, ed., MIT Press, 1990.
[7] L.C. Chu and B.W. Wah,“Optimization in real time,” Proc. Real Time Systems Symp., pp. 150159, Nov. 1991.
[8] L.C. Chu,“Algorithms for combinatorial optimization in real time and their automated refinement by genetic programming,” PhD thesis, Dept. of Electrical and Computer Eng., Univ. of Illi nois, Urbana, Ill., May 1994.
[9] J.L. Devore,Probability and Statistics for Engineering and the Sciences.Monterey, Calif.: Brooks/Cole, 1982.
[10] J.M. Fitzpatrick and J.J. Grefenstette,“Genetic algorithms in noisy environments,” Machine Learning, vol. 3, no. 2/3, pp. 101120, Oct. 1988.
[11] C.M. Fonseca and P.J. Fleming,“Genetic algorithms for multiobjective optimization: Formulation, discussion, and generalization,” Proc. Fifth Int’l Conf. Genetic Algorithms, pp. 416423, June 1993.
[12] F.W. Gembicki,“Vector optimization for control with performance and parameter sensitivity indices,” PhD thesis, Case Western Reserve Univ., Cleveland, 1974.
[13] J.J. Grefenstette,C.L. Ramsey,, and A.C. Schultz,“Learning sequential decision rules using simulation models and competition,” Machine Learning, vol. 5, pp. 355381, 1990.
[14] A. Ieumwananonthachai,A.N. Aizawa,S.R. Schwartz,B.W. Wah,, and J.C. Yan,“Intelligent mapping of communicating processes in distributed computing systems,” Proc. Supercomputing’91, pp. 512521,Albuquerque, N.M., Nov. 1991.
[15] A. Ieumwananonthachai,A. Aizawa,S.R. Schwartz,B.W. Wah,, and J.C. Yan,“Intelligent process mapping through systematic improvement of heuristics,” J. Parallel and Distributed Computing, vol. 15, pp. 118142, June 1992.
[16] J.R. Koza,Genetic Programming.Cambridge, Mass.: MIT Press, 1992.
[17] LayoutSynth92, International Workshop on Layout Synthesis, ftp site: mcnc.mcnc.org in directory /pub/benchmark, 1992.
[18] M.B. Lowrie and B.W. Wah,“Learning heuristic functions for numberic optimization problems,” Proc. Computer Software and Applications Conf., pp. 443450,Chicago, Oct. 1988.
[19] P. Mehra and B.W. Wah,Load Balancing: An Automated Learning Approach. World Scientific Publishing Co. Pte. Ltd., 1995.
[20] A. Newell,J.C. Shaw,, and H.A. Simon,“Programming the logic theory machine,” Proc. 1957 Western Joint Computer Conf., pp. 230240, 1957.
[21] T. Niermann and J. Patel, HITEC: A Test Generation Package for Sequential Circuits Proc. European Conf. Design Automation, pp. 214218, 1991.
[22] J. Pearl, Heuristics: Intelligent Search Strategies for Computer Problem Solving, AddisonWesley, Reading, Mass., 1984.
[23] C.L. Ramsey and J.J. Grefenstette,“Casebased initialization of genetic algorithms,” Proc. Fifth Int’l Conf. Genetic Algorithms, pp. 8491, June 1993.
[24] D.G. Saab,Y.G. Saab,, and J.A. Abraham,“CRIS: A test cultivation program for sequential VLSI circuits,” Proc. Int’l Conf. Computer Aided Design, pp. 216219,Santa Clara, Calif., 1992.
[25] S.R. Schwarta and B.W. Wah,“Automated parameter tuning in stereo vision under time constraints,” Proc. Int’l Conf. Tools for Artificial Intelligence, pp. 162169, Nov. 1992.
[26] C. Sechen and A. SangiovanniVincentelli, "The TimberWolf Placement and Routing Package," IEEE J. SolidState Circuits, vol. 20, no. 3, pp. 510522, Apr. 1985.
[27] C. Sechen,VLSI Placement and Global Routing Using Simulated Annealing.Boston: Kluwer Academic, 1988.
[28] R.S. Sutton,“Temporal credit assignment in reinforcement learning,” PhD thesis, Univ. of Massachusetts, Amherst, Mass., Feb. 1984.
[29] C.C. Teng and B.W. Wah, “An Automated Design System for Finding the Minimal Configuration of a FeedForward Neural Network,” Proc. IEEE Int'l Conf. Neural Networks, pp. 12951300, June 1994.
[30] Y.L. Tong and D.E. Wetzell,“Allocation of observations for selecting the best normal population,” Design of Experiments: Ranking and Selection, T.J. Santner and A.C. Tamhane, eds., pp. 213224.New York: Marcel Dekker, 1984.
[31] B.W. Wah,“Populationbased learning: A new method for learning from examples under resource constraints,” IEEE Trans. Knowledge and Data Engineering, vol. 4, no. 5, pp. 454574, Oct. 1992.
[32] J.C. Yan and S.F. Lundstrom,“The PostGame analysis framework—developing resource management strategies for concurrent systems,” IEEE Trans. Knowledge and Data Engineering, vol. 1, no. 3, pp. 293309, Sept. 1989.
[33] C.F. Yu and B.W. Wah,“Learning dominance relations in combinatorial search problems,” IEEE Trans. Software Engineering, vol. 14, no. 8, pp. 1,1551,175, Aug. 1988.