Evolutionary Computation: Toward a New Philosophy of Machine IntelligenceJohn Wiley & Sons, 3 янв. 2006 г. - Всего страниц: 296 This Third Edition provides the latest tools and techniques that enable computers to learn The Third Edition of this internationally acclaimed publication provides the latest theory and techniques for using simulated evolution to achieve machine intelligence. As a leading advocate for evolutionary computation, the author has successfully challenged the traditional notion of artificial intelligence, which essentially programs human knowledge fact by fact, but does not have the capacity to learn or adapt as evolutionary computation does. Readers gain an understanding of the history of evolutionary computation, which provides a foundation for the author's thorough presentation of the latest theories shaping current research. Balancing theory with practice, the author provides readers with the skills they need to apply evolutionary algorithms that can solve many of today's intransigent problems by adapting to new challenges and learning from experience. Several examples are provided that demonstrate how these evolutionary algorithms learn to solve problems. In particular, the author provides a detailed example of how an algorithm is used to evolve strategies for playing chess and checkers. As readers progress through the publication, they gain an increasing appreciation and understanding of the relationship between learning and intelligence. Readers familiar with the previous editions will discover much new and revised material that brings the publication thoroughly up to date with the latest research, including the latest theories and empirical properties of evolutionary computation. The Third Edition also features new knowledge-building aids. Readers will find a host of new and revised examples. New questions at the end of each chapter enable readers to test their knowledge. Intriguing assignments that prepare readers to manage challenges in industry and research have been added to the end of each chapter as well. This is a must-have reference for professionals in computer and electrical engineering; it provides them with the very latest techniques and applications in machine intelligence. With its question sets and assignments, the publication is also recommended as a graduate-level textbook. |
Результаты поиска по книге
Результаты 1 – 5 из 61
Стр. xii
... indicates the manner in which artificial entities can be designed to yield intelligent behavior. The argument offered in this book is that the process of evolution accounts for such behavior and provides the foundation for the design of ...
... indicates the manner in which artificial entities can be designed to yield intelligent behavior. The argument offered in this book is that the process of evolution accounts for such behavior and provides the foundation for the design of ...
Стр. 5
... indicated through considerable analysis that these machines are universal, that is, all computable processes can be executed by such a machine. Thus, the restriction to digital computers was not a significant limitation of the test ...
... indicated through considerable analysis that these machines are universal, that is, all computable processes can be executed by such a machine. Thus, the restriction to digital computers was not a significant limitation of the test ...
Стр. 6
... indicates that any potential gain to one player will be reflected as a corresponding loss to the other player. The term ... indicated the worth of the prospective board under evaluation. The most critical and obvious parameter was the ...
... indicates that any potential gain to one player will be reflected as a corresponding loss to the other player. The term ... indicated the worth of the prospective board under evaluation. The most critical and obvious parameter was the ...
Стр. 7
... indicated that the learning procedure did work and that the rate of learning was surprisingly high, but that the learning was quite erratic and none too stable” (Samuel, 1959). In retrospect, the correctness of this analysis can be ...
... indicated that the learning procedure did work and that the rate of learning was surprisingly high, but that the learning was quite erratic and none too stable” (Samuel, 1959). In retrospect, the correctness of this analysis can be ...
Стр. 8
... indicated that Nealey was in fact not a former Connecticut state champion at the time of the match again Samuel's program, although he did earn that title in 1966, four years later. Nealey did not enter the U.S. Championship Checkers ...
... indicated that Nealey was in fact not a former Connecticut state champion at the time of the match again Samuel's program, although he did earn that title in 1966, four years later. Nealey did not enter the U.S. Championship Checkers ...
Содержание
1 | |
2 Natural Evolution | 33 |
3 Computer Simulation of Natural Evolution | 59 |
4 Theoretical and Empirical Properties of Evolutionary Computation | 105 |
5 Intelligent Behavior | 183 |
6 Perspective | 249 |
Glossary | 263 |
Index | 267 |
About the Author | 273 |
Другие издания - Просмотреть все
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence David B. Fogel Просмотр фрагмента - 1995 |
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence David B. Fogel Просмотр фрагмента - 2006 |
Evolutionary Computation: Toward a New Philosophy of Machine Intelligence David B. Fogel Недоступно для просмотра - 2006 |
Часто встречающиеся слова и выражения
adaptive Angeline artificial intelligence Atmar Bäck best-evolved Bremermann checkers Chellapilla and Fogel chromosome coding complete Conf convergence crossover Cybernetics D. B. Fogel described distribution edited environment evaluated Evolution Strategies evolutionary algorithm Evolutionary Computation Evolutionary Programming evolved experiments Figure fitness FSMs function fuzzy Gaussian gene Genetic Algorithms genotype global global optimum Holland human IEEE IEEE Trans improvement indicated individual initial input iterated Jong learning Mayr mechanism method Morgan Kaufmann move mutation neural network nodes offered offspring opponent optimization optimum organisms output parameter parents payoff perceptron performance phenotypic play player Pleiotropy population possible prediction probability problem Proc procedure random variable randomly Rechenberg recombination reproduction rithms sampling San Mateo schemata Schraudolph Schraudolph and Belew Schwefel score sequence solution specific standard deviation strings symbols theorem tic-tac-toe tion tionary traveling salesman problem trials Turing Turing Test uniform crossover vector
Популярные отрывки
Стр. 3 - What will happen when a machine takes the part of A in this game?' Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, 'Can machines think?
Стр. 4 - I believe that in about fifty years' time it will be possible to programme computers, with a storage capacity of about 109, to make them play the imitation game so well that an average interrogator will not have more than 70 per cent, chance of making the right identification after five minutes of questioning. The original question, ' Can machines think ? ' I believe to be too meaningless to deserve discussion.
Стр. 186 - Gaussian random variable with zero mean and a standard deviation of 0.05, and 2. With a probability of 0.5, the number of nodes in the hidden layer was allowed to vary. If a change was indicated, there was an equal likelihood that a node would be added or deleted, subject to the constraints on the maximum and minimum number of nodes (10 and one, respectively). Nodes to be...
Стр. 39 - In such systems, the whole is more than the sum of the parts, not in an ultimate, metaphysical sense, but in the important pragmatic sense that, given the properties of the parts and the laws of their interaction, it is not a trivial matter to infer the properties of the whole.
Стр. 254 - The Basic Credit-assignment Problem for Complex Reinforcement Learning Systems In playing a complex game such as chess or checkers, or in writing a computer program, one has a definite success criterion — the game is won or lost. But in the course of play, each ultimate success (or failure) is associated with a vast number of internal decisions. If the run is successful, how can we assign credit for the success among the multitude of decisions? As Newell noted, It is extremely doubtful whether...
Стр. 223 - Class A, Class B, Class C, Class D, Class E, Class F, and Class G, respectively.
Стр. 254 - For learning to take place, each play of the game must yield much more information. This is . . . achieved by breaking the problem into components. The unit of success is the goal. If a goal is achieved, its subgoals are reinforced; if not they are inhibited. (Actually, what is reinforced is the transformation rule that provided the subgoal.) . . . This...
Стр. 21 - Fogel et al., 1966, p. 2), intelligence may be defined as the capability of a system to adapt its behavior to meet its goals in a range of environments.
Стр. 250 - Now might I do it, pat, now he is praying; And now I'll do't; — and so he goes to heaven: And so am I reveng'd ? That would be scann'd : A villain kills my father; and, for that, I, his sole son, do this same villain send To heaven.
Стр. 7 - I've been able to find. It is very interesting to me to note that the computer had to make several star moves in order to get the win, and that I had several opportunities to draw otherwise. That is why I kept the game going. The machine, therefore, played a perfect ending without one misstep. In the matter of the end game, I have not had such competition from any human being since 1954, when I lost my last game.