University of Hertfordshire

By the same authors

A Simple Modularity Measure for Search Spaces based on Information Theory

Research output: Chapter in Book/Report/Conference proceedingChapter

Standard

A Simple Modularity Measure for Search Spaces based on Information Theory. / Dauscher, P.; Polani, D.; Watson, R.

Procs Artificial Life X. MIT Press, 2006. p. 344-350.

Research output: Chapter in Book/Report/Conference proceedingChapter

Harvard

Dauscher, P, Polani, D & Watson, R 2006, A Simple Modularity Measure for Search Spaces based on Information Theory. in Procs Artificial Life X. MIT Press, pp. 344-350.

APA

Dauscher, P., Polani, D., & Watson, R. (2006). A Simple Modularity Measure for Search Spaces based on Information Theory. In Procs Artificial Life X (pp. 344-350). MIT Press.

Vancouver

Dauscher P, Polani D, Watson R. A Simple Modularity Measure for Search Spaces based on Information Theory. In Procs Artificial Life X. MIT Press. 2006. p. 344-350

Author

Dauscher, P. ; Polani, D. ; Watson, R. / A Simple Modularity Measure for Search Spaces based on Information Theory. Procs Artificial Life X. MIT Press, 2006. pp. 344-350

Bibtex

@inbook{6f4604fec66f4152a48e6ced7ff24146,
title = "A Simple Modularity Measure for Search Spaces based on Information Theory",
abstract = "Within the context of Artificial Life the question about the role of modularity has turned out to be crucial, especially with regard to the problem of evolvability. In order to be able to observe the development of modular structure, appropriate modularity measures are important. We introduce a continuous measure based on information theory which can characterize the coupling among subsystems in a search problem. In order to illustrate the concepts developed, they are applied to a very simple and intuitive set of combinatorial problems similar to scenarios used in the seminal work by Simon (1969). It is shown that this measure is closely related to the classification of search problems in terms of Separability, Non-Decomposability and Modular Interdependency as introduced in (Watson and Pollack, 2005).",
author = "P. Dauscher and D. Polani and R. Watson",
note = "Copyright MIT Press",
year = "2006",
language = "English",
isbn = "978-0-262-68162-9",
pages = "344--350",
booktitle = "Procs Artificial Life X",
publisher = "MIT Press",

}

RIS

TY - CHAP

T1 - A Simple Modularity Measure for Search Spaces based on Information Theory

AU - Dauscher, P.

AU - Polani, D.

AU - Watson, R.

N1 - Copyright MIT Press

PY - 2006

Y1 - 2006

N2 - Within the context of Artificial Life the question about the role of modularity has turned out to be crucial, especially with regard to the problem of evolvability. In order to be able to observe the development of modular structure, appropriate modularity measures are important. We introduce a continuous measure based on information theory which can characterize the coupling among subsystems in a search problem. In order to illustrate the concepts developed, they are applied to a very simple and intuitive set of combinatorial problems similar to scenarios used in the seminal work by Simon (1969). It is shown that this measure is closely related to the classification of search problems in terms of Separability, Non-Decomposability and Modular Interdependency as introduced in (Watson and Pollack, 2005).

AB - Within the context of Artificial Life the question about the role of modularity has turned out to be crucial, especially with regard to the problem of evolvability. In order to be able to observe the development of modular structure, appropriate modularity measures are important. We introduce a continuous measure based on information theory which can characterize the coupling among subsystems in a search problem. In order to illustrate the concepts developed, they are applied to a very simple and intuitive set of combinatorial problems similar to scenarios used in the seminal work by Simon (1969). It is shown that this measure is closely related to the classification of search problems in terms of Separability, Non-Decomposability and Modular Interdependency as introduced in (Watson and Pollack, 2005).

M3 - Chapter

SN - 978-0-262-68162-9

SN - 0-262-68162-5

SP - 344

EP - 350

BT - Procs Artificial Life X

PB - MIT Press

ER -