Advertisement

Intelligent Resource Management Through the Constrained Resource Planning Model

  • David Y. Y. Yun
Part of the Studies in Fuzziness and Soft Computing book series

Abstract

Objective: Introduce a resource management methodology, known as the Constrained Resource Planning (CRP), together with a flexible and powerrfuul computing “engine ”, suitable for most planning and scheduling applications under stringent solution requirements, tightly interacting constraints, as well as restricted resource availability and utilization. Methodology: By the effective utilization of two domain-independent guiding principles (i) the most-constrained strategy for task identification and the least-impact strategy for solution selection (ii) the algorithmic procedure of CRP allows widely varying problems to be mapped and solved without changing the underlying problem solving mechanisms &#x—; the CRP engine. Quality Unlike most heuristic approaches that can be trapped into locally- or non-optimal solutions, CRP has been shown to produce provably optimal solutions for a variation of the classic, NP-complete traveling salesman problem, known as the diamond lattice problem. Applicability: Over 40 resource allocation and activity scheduling problems have been solved using the CRP methodology and computing engine. Capitalizing on CRP’s ability to delicately integrate and balance complementary and conflicting objectives, CRP-solved applications have demonstrated a consistency to achieve quality solutions and display surprising intelligence for well known difficult problems, such as multiprocessor scheduling, 3D model discovery, and DNA folding, in addition to providing intelligent solutions for most challenging and NP-hard problems as maximal common subgraph. Signiificance: Due to its broad applicability, solution quality and computational efficacy, CRP is offered both as a general, problemsolving methodology for tackling difficult problems and as an executable computing engine capable oof achieving solutions even beyond human intelligence. CRP also guides a problem solver to tackle resource confined decision problems with simultaneous objectives and conflicting constraints through a set of disciplined strategies and balanced principles.

Keywords

Resource management constrained resource planning constraint satisfacttion optimization planning and scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. R. Akhter, D. Y. Y. Yun and H. Tian, (1991), “A Resource Management Approach to Schedule Manufacturing Processes”, University of Hawaii MS thesisGoogle Scholar
  2. 2.
    Bowers, M. R. and J. P. Jarvis, (1992), “A Hierarchical Production Planning and Scheduling Model,” Decision Sciences, 23, 144–159.CrossRefGoogle Scholar
  3. 3.
    J. Barney, (1991) “The Resource-Based Model of the Firm: Origins, Implications, and Prospects”, Journal of Management, Vol. 17, No. 1, pp. 97–98.CrossRefGoogle Scholar
  4. 4.
    J. Barney, (1991) Firm Resources and Sustained Competitive Advantage, Journal of Management, Vol. 17, No. 1, pp. 99–120.CrossRefGoogle Scholar
  5. 5.
    P. S. Bender, (1983), Resource Management — An Alternative View of the Management Process, John Wiley & SonsGoogle Scholar
  6. 6.
    Blazewicz, J., M. Dror, and J. Weglarz, (1991), Mathematical programming formulations for machine scheduling: A survey, European Journal of Operational Research, 51, 283–300.zbMATHCrossRefGoogle Scholar
  7. 7.
    T. Cheng and D. Y. Y. Yun, (1991), “Reasoning Three-Dimensional Relationships from Two-Dimensional Drawings by Planning,” Proceedings of OCEANS ’91, Honolulu, HI.Google Scholar
  8. 8.
    W. K. Chou and D. Y. Y. Yun, (1992), “Logic Minimization: A Planning Approach”, Proc. the 1992 International Computer Symposium (ICS’’92), Taiwan.Google Scholar
  9. 9.
    T. Cheng and D. Y. Y. Yun, (1994), Drawing Labeling by a Cascaded Planning Model — CCRP, Proc. 3rd International Conf. on Automation, Robotics and Computer Vision (ICARCV ’94), SPICIS’94, pp.483–488Google Scholar
  10. 10.
    T. Cheng and D. Y. Y. Yun, (1994), Canonical Modeling and Multiview Indexing for 3D Object Recognition, Proc. 3rd Intern’l Conf. on Automation, Robotics and Computer Vision (ICARCV ’94), pp.2000–2004Google Scholar
  11. 11.
    C. W. Chen and D. Y. Y. Yun, (1997), Variable Block-size Image Coding by Resource Planning, Proc. International Conference on Imaging Science, Systems, and Technology, Las Vegas, NV.Google Scholar
  12. 12.
    C. W. Chen and D. Y. Y. Yun, (1998), Automation of 3D Object Modeling from Multiple Line-Drawing Views, 1998 Symposium on Image, Speech, Signal Processing, and Robotics, Hong Kong, China.Google Scholar
  13. 13.
    H. M. Chen and D. Y. Y. Yun, (1996), Sharing Computational Resources and Medical Images via ACTS-linked Networks, Proc. 18th Annual Pacific Telecommunication Conference, Honolulu, HI;Google Scholar
  14. 13a.
    H. M. Chen and D. Y. Y. Yun also published in Pacific Telecommunication Review Vol.17, No. 4, June 1996, pp. 15–28.Google Scholar
  15. 14.
    C. W. Chen, (1999), Algorithms for Maximal Common Subgraph Problem using Resource Planning, Ph.D. Dissertation, (Advisor: D. Y. Y. Yun), U. HawaiiGoogle Scholar
  16. 15.
    T. Cheng, (1994), Automatic Labeling, Modeling and Recognition for Line-Drawing Interpretation, Ph.D. Dissertation, (Advisor: D. Y. Y. Yun), U. HawaiiGoogle Scholar
  17. 16.
    H.-M Chen, D. Y. Y. Yun, Y. Ge and J. Khan, (1996), “Computer-Aided Resource Planning and Scheduling for Radiological Services,” Proc. PACS Design and Evaluation: Engineering and Clinical Issues, Medical Image, CA Google Scholar
  18. 17.
    Elmaghraby, S. E., (1993), Resource Allocation Via Dynamic Programming in Activity Networks, European Journal of Operational Research, 64, 199–215.zbMATHCrossRefGoogle Scholar
  19. 18.
    S. M. Feng, B. G. Qiu and D. Y. Y. Yun, (1994), A Graphic Simulator for Autonomous Underwater Vehicle Docking Operations, Proc. of OCEANS 94, Sept.13–16, Brest, France.Google Scholar
  20. 19.
    X. M. Feng and D. Y. Y. Yun, (1992) Scheduling of Steerable Antenna on Satellite by Resource management, Proc. Advanced Communications Technology Satellite Conf. Google Scholar
  21. 20.
    M. M. Flood, (1956), The Traveling-Salesman Problem, Operation Research, 4, 61–75.MathSciNetCrossRefGoogle Scholar
  22. 21.
    K. C. Gilbert and R. B. Hofstra, “A New Multi-period Multiple Traveling Salesman Problem with Heuristic and Application to a Scheduling Problem,“ Decision Sciences, 23 (1992), 250–259CrossRefGoogle Scholar
  23. 22.
    Gu, J. and X. Huang, (1994), Efficient Local Search With Search Space Smoothing: A Case Study of the Traveling Salesman Problem, IEEE Transactions on Systems, Man, and Cybernetics, 24, 5, 728–735.CrossRefGoogle Scholar
  24. 23.
    D. G. Gattrysse and L. N. V. Wassenhove, (1992), A Survey of Algorithms for the Generalized Assignment Problem, European J. of Operational Research, Vol. 60, pp. 260–272.CrossRefGoogle Scholar
  25. 24.
    H. M. C. Garcia and D. Y. Y. Yun, (1995), Intelligent Distributed Medical Image Management, Proc. SPIE Medical Imaging, San Diego, CA.Google Scholar
  26. 25.
    Y. Ge and D. Y. Y. Yun, (1996), “Simultaneous Compression of Makespan and Number of Processors Using CRP,” Proceedings of 1996 International Parallel Processing Symposium Google Scholar
  27. 26.
    Y. Ge and D. Y. Y. Yun, (1996), “A Method that Determines Optimal Grain Size and Inherent Parallelism Concurrently,” Proceedings of International Symposium on Parallel Architecture, Algorithms, and Networks (ISPAN)Google Scholar
  28. 27.
    Y. Ge and D. Y. Y. Yun, (1996), Simultaneous Determination of Optimal Grain Size and Inherent Parallelism for Parallel Programming Environments, Proc. of IEEE Second International Conference on Algorithms and Architectures for Parallel Processing, Beijing, China.Google Scholar
  29. 28.
    Y. Ge and D. Y. Y. Yun, (1996), A General Planning and Scheduling Methodology for Solving Task Scheduling with Multiple Objectives, Proc. of LASTED International Conf. on Artificial Intelligence, Expert Systems and Neural Networks Google Scholar
  30. 29.
    Y. Ge, (1996), A Simultaneous Compression Model for Multiprocessor Scheduling, Ph.D. Dissertation (Advisor: D. Y. Y. Yun), Department of Electrical Engineering, University of HawaiiGoogle Scholar
  31. 30.
    H. M. C. Garcia, Y. Ge, and J. Khan and D. Y. Y. Yun, (1996), Computer-Aided Resource Planning and Scheduling for Radiological Services, Proc. SPIE workshop on PACS Design and Evaluation: Engineering and Clinical Issues Google Scholar
  32. 31.
    J. J. Gray, D. McIntire and H. J. Doller, (1990), Preferences for specific work schedules: Foundation for an expert-system scheduling program, Dallas Veterans Administration Hospital Technical Report Google Scholar
  33. 32.
    Held, M. and R. M. Karp, (1970 and 1971), The travelling Salesman Problem and Minimum Spanning Trees, Part I, Operational Research, 18, 1138–1162; andMathSciNetzbMATHCrossRefGoogle Scholar
  34. 32a.
    Held, M. and R. M. Karp, (1970 and 1971), The travelling Salesman Problem and Minimum Spanning Trees, Part II, Mathematical Programming, 1, 6–26.MathSciNetzbMATHCrossRefGoogle Scholar
  35. 33.
    Y. H. Hu and S. J. Chen, (1990), “GM_Plan: a gate matrix layout algorithm based on artificial intelligence planning techniques”, IEEE Transactions on Computer-Aided Design, Vol. 9, No. 8Google Scholar
  36. 34.
    P. W. Huang and D. Y. Y. Yun, (1987), “A Representation Model and Inference Procedure for Intelligent Agents”, Proceedings of the 2nd International Conference on Applications of Artiifiicial Intelligence in Engineering, Cambridge. MA.Google Scholar
  37. 35.
    Y. H. Hu and D. Y. Y. Yun, (1991), “Model-Based Expert System for Digital System Design”, IEEE Computer Society Press, Tutorial: Knowledge-Based Systems: Fundamentals and Tools, O. N. Garcia and Y-T Chien, eds.,.Google Scholar
  38. 36.
    Ho, W. P-C., D. Y. Y. Yun, and Y. H. Hu, Planning Strategies for Switchbox Routing, Proc. IEEE International Conf. on Computer Design, (1985), 463–467.Google Scholar
  39. 37.
    Hsu, W.-L., M. J. Prietula, and G. L. Thompson, “A Mixed-Initiative Scheduling Workbench: Integrating AI, OR and HCI,” Decision Support Systems, 9 (1993), 245–257CrossRefGoogle Scholar
  40. 38.
    P. W. Huang, The Formation and Application of an Intelligent Agent Model, Ph.D. Dissertation (Advisor: D. Y. Y. Yun), Computer Science and Engineering Department, SMU, 1989.Google Scholar
  41. 39.
    Jeffcoat, D. E. and R. L. Bulfin, “Simulated Annealing for Resource-Constrained Scheduling,” European Journal of Operational Research, 70, 1993, pp. 43–51.zbMATHCrossRefGoogle Scholar
  42. 40.
    N. P. Keng and D. Y. Y. Yun, “A Planning/Scheduling Methodology for the Constrained Resource Problem”, Proc. of the Eleventh International Joint Conf. on Artiifiicial Intelligence, Aug. 1989, pp. 20–25.Google Scholar
  43. 41.
    Y. H. Kuo and D. Y. Y. Yun, “A CRP-based Planning and Scheduling Shell for Resource Management”, EE Technical Report, University of Hawaii, Jan. 1991Google Scholar
  44. 42.
    N. P. Keng, Planning and Scheduling with the Constrained-Resource Model (CR-Model), Ph.D. Dissertation (Advisor: D. Y. Y. Yun), Computer Science and Engineering Department, SMU, 1988.Google Scholar
  45. 43.
    N. P. Keng, W. P-C. Ho and D. Y. Y. Yun, (1987), “The Manual of the Switchbox Router”, SMU Computer Science and Engineering, TR87-CSE-2Google Scholar
  46. 44.
    N. P. Keng, W. Ho, and D. Y. Y. Yun, Interaction-Sensitive (Intelligent) Backtracking in a Planning System for Switchbox Routing, Proc. of Applications of Artiifiicial Intelligence in Engineering 87. Google Scholar
  47. 45.
    Kirkpatrick, S. et al, Optimization by Simulated Annealing, Science, 220 (1983), 671.MathSciNetzbMATHCrossRefGoogle Scholar
  48. 46.
    G. Klein, I. C. Liu, and D. Y. Y. Yun, (1988), “Artificial Intelligence in the Architecture of Decision Support Systems”, Proceedings of the Conference on Impact of Artiifiicial Intelligence on Business and Industry Google Scholar
  49. 47.
    G. Klein, I. C. Liu, and D. Y. Y. Yun, (1990), “An Agent for Intelligent Model Management”, Journal of Management ScienceGoogle Scholar
  50. 48.
    N. P. Keng, D. Y. Y. Yun, and M. Rossi, (1988), “Interaction-Sensitive Planning System for Job-Shop Scheduling”, Expert Systems and Intelligent Manufacturing, M. Oliff (ed.), N. Holland, pp.57–69.Google Scholar
  51. 49.
    Lin, S. and B. W. Kernighan, “An Effective Heuristic Algorithm for the Travelling Salesman Problem,“ Operational Research, 21 (1977), 498–516.MathSciNetGoogle Scholar
  52. 50.
    Lawrence, S. R. and T. E. Morton, (1993), “Resource-Constrained Multi-Project Scheduling with Tardy Costs: Comparing Myopic, Bottleneck, and Resource Pricing Heuristics,” European Journal of Operational Research, 64, 168–187.zbMATHCrossRefGoogle Scholar
  53. 51.
    Leclerc, M. and F. Rendl, (1989), “Constrained Spanning Trees and the Travelling Salesman Problem,” European Journal of Operational Research, 39, 96–102.MathSciNetzbMATHCrossRefGoogle Scholar
  54. 52.
    Ling, Z. and D. Y. Y. Yun, (1996), “Solving Subgraph Isomorphism Problem by a New Planning Methodology”, Proc. LASTED International Conf. on Artiifiicial Intelligence, Expert Systems and Neural Networks, Honolulu, HawaiiGoogle Scholar
  55. 53.
    Ling, Z. and D. Y. Y. Yun, (1996), “An Efficient Subcircuit Extraction Algorithm by Resource Management Approach”, Proceedings of Second International Conference On ASIC, Shanghai, P. R. China, 21–24Google Scholar
  56. 54.
    T. Y. Lu and D. Y. Y. Yun, (1997), Optimal Iso-Surface Triangulation, Proc. International Conf on Imaging Science, Systems, and Technology, Las Vegas, NV.Google Scholar
  57. 55.
    Leung, J., “A New Graph-Theoretic Heuristic for Facility Layout,” Management Science, 4, 38 (1992), 594–607CrossRefGoogle Scholar
  58. 56.
    I. C. Liu, An Intelligent Agent to the Decision Support Model/Knowledge Base, Ph.D. Dissertation (Advisor: D. Y. Y. Yun), Computer Science and Engineering Department, SMU, 1989.Google Scholar
  59. 57.
    T. Y. Lu, J. Khan and D. Y. Y. Yun, (1996), An Optimizing Algorithm for 3D Object Surface Triangulation, Proc. of IASTED International Conf. on Artiifiicial Intelligence, Expert Systems and Neural Networks, Honolulu., HI.Google Scholar
  60. 58.
    Lawler, E. L., J. K. Lenstra, A. H. G. R. Kan and D. B. Shmoys, (1985), The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, NYGoogle Scholar
  61. 59.
    Luss, H., “Minimax Resource Allocation Problems: Optimization and Parametric analysis,” European Journal of Operational Research, 60 (1992), 76–86.zbMATHCrossRefGoogle Scholar
  62. 60.
    I. C. Liu, D. Y. Y. Yun and G. Klein, (1989), “An Intelligent Agent Consulting System for Production and Operations Management”, Proc. Third International Conference on Expert Systems and the Leading Edge in Production and Operations Management, Hilton Head, SCGoogle Scholar
  63. 61.
    I. C. Liu, D. Y. Y. Yun and G. Klein, (1990), “An Agent for Intelligent Model Management,” Journal of Management Information Systems, 7, 1, 101–122.Google Scholar
  64. 62.
    Magirou, V. F. and J. Z. Milis, An Algorithm for the Multiprocessor Assignment Problem, Operations Research Letter, 8, 1989, 351–356.MathSciNetzbMATHCrossRefGoogle Scholar
  65. 63.
    Miller, D. L. and J. F. Perkny, Exact Solution of Large Asymmetric Traveling Salesman Problems, Science, 251, 1991, 754–761.CrossRefGoogle Scholar
  66. 64.
    Prentis, E. L. and B. M. Khumawala, (1989), “Efficient Heuristics for MRP Lot Sizing with Variable Production/Purchasing Costs,” Decision Sciences, 20, 439–450CrossRefGoogle Scholar
  67. 65.
    Padman, R. and D. E. Smith-Daniels, “Early-Tardy Cost Trade-Offs in Resource Constrained Projects with Cash Flows: An Optimization-Guided Heuristic Approach,” European Journal of Operational Research, 64 (1993), 295–311.zbMATHCrossRefGoogle Scholar
  68. 66.
    Padmanabhan, G., “Analysis of Multi-item inventory systems under resource constraints: A Non-linear Goal Programming Approach,” Engineering Costs and Production Economics, 20, 2 (1990), 121CrossRefGoogle Scholar
  69. 67.
    B. G. Qiu and X. M. Feng, (1991), “Trajectory Planning of Underwater Vehicle using Dynamic CRP Model”, Proceedings of OCEANS 91, Honolulu, HI.Google Scholar
  70. 68.
    M. A. Rossi, Application of the Constrained-Resource Model (CR-Model) toward Flexible Job-shop Scheduling, MS Thesis, (Advisor: D. Y. Y. Yun), Computer Science and Engineering Dept., SMU, 1989.Google Scholar
  71. 69.
    N. Sadeh and M. Fox, “Variable and Value Ordering Heuristics for Activity-based Job-shop Scheduling”, School of Computer Science Report, Carnegie Mellon University, 1990.Google Scholar
  72. 70.
    Shen, C. C. and W. H. Tsai, “A graph matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion,” IEEE Transactions on Computers, 34 (1985), 197–203.CrossRefGoogle Scholar
  73. 71.
    E. Sacerdoti, (1974), Planning in a Hierarchy of Abstraction Spaces, Artificial Intelligence, 5, 115–35.zbMATHCrossRefGoogle Scholar
  74. 72.
    N. Sadeh, (1990), “Generating Advice for Hard Constraint Satisfaction Problems: an Application to Job-Shop Scheduling”, Computer Science Report, Carnegie Mellon UniversityGoogle Scholar
  75. 73.
    Sun, T., P. Meakin and T. Jossang, A Fast Optimization Method Based on Hierarchical Strategy for the Travelling Salesman Problem, PHYSICA, (1993).Google Scholar
  76. 74.
    Sofianopoulou, S., “The Process Allocation Problem: a Survey of the Application of Graph-Throretic and Integer programming Approaches,” also published in the Journal of Operational Research Society, 43, 5, 1992, pp. 407–413.Google Scholar
  77. 75.
    Stone, H. S., “Multiprocessor Scheduling With the Aid of Network Flow Algorithms,” IEEE Transactions on Software Engineering, 3 (1977), pp. 85–93zbMATHCrossRefGoogle Scholar
  78. 76.
    Sim, S. K., K. T. Yeo and W. H. Lee, An Expert Neural Network System for Dynamic Job Shop Scheduling, International Journal of Production Research, 32, 8 (1994), 1759.zbMATHCrossRefGoogle Scholar
  79. 77.
    H. Tian and D. Y. Y. Yun, (1991), “A Requirements/Knowledge Acquisition Methodology”, Proc. AAAI’91 Workshop on Automatic Software Design, AnaheimGoogle Scholar
  80. 78.
    H. Tian and D. Y. Y. Yun, (1991), “A Heuristic Methodology for Oceanic Resource Management”, Proceedings oof OCEANS’91, Honolulu, HI.Google Scholar
  81. 79.
    H. Tian and D. Y. Y. Yun, (1991), “A More Complete Knowledge Acquisition Methodology”, Proceedings of The World Congress on Expert Systems, OrlandoGoogle Scholar
  82. 80.
    Tsai, W. H., Nonlinear Multiproduct CVP Analysis With 0–1 Mixed Integer Programming, Engineering Costs and Production Economics, 20, 1 (1990), 81CrossRefGoogle Scholar
  83. 81.
    R. L. Tsai, A Heuristic for Static Task-to-Processor Assignment using a Constrain Satisfaction Approach, Ph.D Dissertation (Advisor: D. Y. Y. Yun), Computer Science and Engineering Dept., SMU, 1988.Google Scholar
  84. 82.
    Warkkentin, M. and P. Evans, AI in Business and Management, PC AI, 7, 2 (1993), 35.Google Scholar
  85. 83.
    J. G. Wu, Y. H. Hu, D. Y. Y. Yun, and W. P. C. Ho, (1990), “A Model-based Expert System for Digital System Design”, IEEE Design and Test of Computers, pp. 24–41.Google Scholar
  86. 84.
    Wilkins, D. E., Practical Planning: Extending the Classical Planning Paradigm, Morgan Kaufmann Publishers, Inc., (1988).Google Scholar
  87. 85.
    Wilson, J. M., “Approaches to Machine Load Balancing in Flexible Manufacturing Systems,” OR: the Journal of Operational Research Society, 43, 5 (1992), 415–423.zbMATHGoogle Scholar
  88. 86.
    Yun, D. Y. Y. and X. Feng, (1993), “Solving 2-Dimensional Packing Problem by Constraint Resource Planning Model with Efficient Symmetry Detection,” UH Technical Report Google Scholar
  89. 87.
    D. Y. Y. Yun and H. Tian, (1991), “A Heuristic Methodology for Oceanic Resource Management”, Proceedings of OCEANS’91, Honolulu, HIGoogle Scholar
  90. 88.
    D. Y. Y. Yun, B. G. Qiu and Z. L. Chen, (1992), “Solving Travelling Salesman Problems by Planning”, Proceedings of the International Conference on Intelligent Information Processing & Systems, (Keynote Paper), Beijing, China, Oct..Google Scholar
  91. 89.
    S. Yih, B. Shirazi and D. Y. Y. Yun, (1989), “Neural Network for Control System Modeling and Design,” Proceedings of Twentieth Annual Pittsburgh Conference on Modeling and Simulation Google Scholar
  92. 90.
    L. Yin, M. Tanik, and D. Y. Y. Yun, (1989), “Intelligent Interactive Interfaces for Laboratory Equipment”, Proceedings of Thirteenth Annual Computer Science Conference, Irving, TexasGoogle Scholar
  93. 91.
    L. Yin, M. Tanik, and D. Y. Y. Yun, (1989), “Design Activity Agent: A Knowledge Based Software Design Environment”, Proc. International Conf. on Software Engineering and Knowledgee Engineering Google Scholar
  94. 92.
    D. Y. Y. Yun, (1990), “The Evolution of Computing Software Tools” (Keynote), Computing Tools for Scientific Problem Solving, Academic Press, pp. 7–22.Google Scholar
  95. 93.
    D. Y. Y. Yun, (1992), CRP — an Intelligent Engine for Resource and Production Management, exhibition brochure for COMDEX ’92, nominated for Byte Magazine best new software award.Google Scholar
  96. 94.
    Y. Zong, T. Yang and J. P. Ignizio, (1993), “An Expert System Using an Exchange Heuristic for the Resource-Constrained Scheduling Problem,” Expert Systems with Applications, 6, 3, 327.CrossRefGoogle Scholar
  97. 95.
    C. W. Chen and D. Y. Y. Yun, (1999), “Knowledge Discovery for Protein Tertiary Substructures”, Proc. 7th workshop on Rough Sets, Fuzzy Sets, Data Mining, and Granular-Softt Computing, also to be published in the Lecture Notes in Artificial Intelligence series, Springer-Verlag.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • David Y. Y. Yun
    • 1
    • 2
  1. 1.Laboratory of Intelligent and Parallel Systems (LIPS)HonoluluUSA
  2. 2.College of EngineeringUniversity of Hawaii (UH)USA

Personalised recommendations