Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Ergodicity

Chapter 4
Handbook of Research on Nature-Inspired Computing for Economics and Management
A function is ergodic if the probability to jump from any point a of the search space to any other point b is not null. A mutation operator randomly flipping a single bit of a bitstring is therefore not strictly ergodic. However, it is ergodic in a loose sense, in that it is possible to obtain any other individual in a finite number of mutations.
Published in Chapter:
Evolutionary Algorithms
P. Collet (Université du Littoral Côte d’Opale, France)
Copyright: © 2007 |Pages: 14
DOI: 10.4018/978-1-59140-984-7.ch004
Abstract
Evolutionary computation is an old field of computer science that started in the end of the 1960s nearly simultaneously in different parts of the world. Each paradigm has evolved separately, apparently without knowledge of what was happening elsewhere, until people finally got together and shared their experience. This resulted in strong trends that still survive, even though it is now possible to outline a generic structure for an evolutionary algorithm that is described in this chapter.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Chapter 5
Wind Loads on Structures, and Energy Dissipation Systems Optimization
An ergodic process is a process which its statistical properties can be deduced from a single, sufficiently long, random sample of the process.
Published in Chapter: Wind Loads on Structures, and Energy Dissipation Systems Optimization; From: Optimization of Design for Better Structural Capacity
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR