Co-Evolutionary Algorithm & Multi-Agent Systems
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > Co-Evolutionary Algorithm & Multi-Agent Systems
Co-Evolutionary Algorithm & Multi-Agent Systems

Co-Evolutionary Algorithm & Multi-Agent Systems

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

The origins of evolutionary computation can be traced back to the late 1950s where it remained, almost unknown, to the broader scientific community for three decades until the 1980s when it started to receive significant attention, as did the study of multi-agent systems (MAS). This focuses on systems in which many intelligent agents interact with each other. Today these systems are not simply a research topic but are also beginning to become an important subject of academic teaching and industrial and commercial application. Co-evolutionary Algorithm & Multi-agent Systems introduces the author's recent work in these two new and important branches of artificial intelligence.

Table of Contents:
Table of Contents Chapter 1 Introduction Evolutionary computation; Structure of evolutionary algorithms; Branches of evolutionary algorithms; Evolutionary computation and complex adaptive systems; Multiagent systems; Agents; MAS Chapter 2 An organizational coevolutionary algorithm for classification Related work; Organizations for classification; Fitness of organizations; Implementation of OCEC; Evaluation of OCEC's effectiveness; Multiplexer problems; Experimental results; Comparison of OCEC with available algorithms; Comparison on UCI repository datasets; Comparison of OCEC with XCS on multiplexer problems; Scalability of OCEC; Practical applications of OCEC; Radar target recognition problems; Remote sensing target recognition;Conclusion Chapter 3 An organizational evolutionary algorithm for satisfiability problems Organizations for SAT problems; Organizational evolutionary operators; Implementation of OEA_SAT; Experiments; Conclusion Chapter 4 An organizational evolutionary algorithm for numerical optimization Organizations for numerical optimization; Evolutionary operators for organizations; Splitting operator; Annexing operator; Cooperating operator; Implementation of OEA; Convergence of OEA; Experiments on unconstrained optimization problems; Experimental results of OEA; Comparison between OEA and FEP; Comparison between OEA and OGA/Q; Experiments on constrained optimization problems; Experimental results of OEA; Comparison between OEA and RY; Comparison between OEA and SMES on G01 to G13; Comparison between OEA and SCA on the four engineering design problems; Parameter analyses of OEA; Effects of No on the performance of OEA; Effects of AS and CS on the Performance of OEA; Effects of MaxOS on the performance of OEA; Conclusion Chapter 5 Moving block sequence: a new VLSI floorplan representation 5.1 Related work 83 5.2 Moving block sequence representation 84 5.3 Algorithm transforming an MBS to a floorplan 87 5.3.1 Information structure for rectilinear blocks 87 5.3.2 Implementation of the algorithm 88 5.3.3 An example 93 5.3.4 Conclusion 94 Chapter 6 An organizational evolutionary algorithm for general floorplanning based on moving block sequence Related work; Organizations for floorplanning; Determining shapes and orientations of various types of blocks; Evolutionary operators for organizations; Implementation of the algorithm; Experiments; Floorplanning problems with hard rectangular blocks; Floorplanning problems with soft rectangular blocks; Floorplanning problems with hybrid blocks; Floorplanning problems with concave blocks; Finding the strength of MBS-OEA; The MBS; The OEA; Conclusion Chapter 7 A multiagent genetic algorithm for global numerical optimization Agents for numerical optimization; Four evolutionary operators for agents; Implementation of MAGA; Convergence of MAGA; Experiments; Descriptions of the compared algorithms; Comparison between FEP, OGA/Q, and MAGA on functions with 30 dimensions; The performance of MAGA on functions with 20 to 1,000 dimensions; Performance of MAGA on functions with 1,000 to 10,000 Dimensions; Experimental studies on the optimal approximation of linear systems; MAGA for the optimal approximation of linear systems; Experiments; Conclusion Chapter 8 A Macroagent evolutionary model for decomposable function optimization Definition of decomposable functions; Macroagent; Macroagent evolutionary model; Hierarchy multiagent Genetic Algorithm; Experiments on HMAGA; Comparison between HMAGA and MAGA on Rosenbrock function with 10 to 1,000 dimensions; Performance of HMAGA on the Rosenbrock function with 1,000 to 50,000 dimensions; Performance analysis of parameter kappa; Conclusion Chapter 9 A multiagent evolutionary algorithm for combinatorial optimization problems Agents for combinatorial optimization problems; Behaviors of agents; Competition behaviour; Self-learning behaviour; Multiagent evolutionary algorithm for combinatorial optimization problems; Implementation of MAEA-CmOPs; Convergence of MAEA-CmOPs; Experiments on deceptive problems; Strong-linkage deceptive functions; Weak-linkage deceptive functions; Overlapping-linkage deceptive functions; Experiments on hierarchical problems; Hierarchical problems; Experiments and analyses; Conclusion Chapter 10 A multiagent evolutionary algorithm for constraint satisfaction problem Constraint satisfaction agents; Constraint satisfaction problems; Definition of constraint satisfaction agents; Environment of constraint satisfaction agents; Behaviors of constraint satisfaction agents; Competitive behaviour; Self-learning behaviour; Mutation behaviour; Implementation of MAEA-CSPs; Complexity analysis; Space complexity of MAEA-CSPs; Convergence of MAEA-CSPs; Experimental studies on non-permutation constraint satisfaction problems; Binary constraint satisfaction problems; Graph-coloring problems; Experimental studies on permutation constraint satisfaction problems; n-Queen problems; Job-shop scheduling problems; Conclusion


Best Sellers


Product Details
  • ISBN-13: 9781845646387
  • Binding: Hardback
  • Language: English
  • Width: 156 mm
  • ISBN-10: 184564638X
  • Height: 234 mm
  • Returnable: N


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Co-Evolutionary Algorithm & Multi-Agent Systems
-
Co-Evolutionary Algorithm & Multi-Agent Systems
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Co-Evolutionary Algorithm & Multi-Agent Systems

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!