<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="de">
		<id>http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Hypergraph-based_Evolutionary_Design_System</id>
		<title>Hypergraph-based Evolutionary Design System - Versionsgeschichte</title>
		<link rel="self" type="application/atom+xml" href="http://de.evo-art.org/index.php?action=history&amp;feed=atom&amp;title=Hypergraph-based_Evolutionary_Design_System"/>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Hypergraph-based_Evolutionary_Design_System&amp;action=history"/>
		<updated>2026-04-13T13:22:18Z</updated>
		<subtitle>Versionsgeschichte dieser Seite in de_evolutionary_art_org</subtitle>
		<generator>MediaWiki 1.27.4</generator>

	<entry>
		<id>http://de.evo-art.org/index.php?title=Hypergraph-based_Evolutionary_Design_System&amp;diff=2512&amp;oldid=prev</id>
		<title>Gbachelier: /* Used References */</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Hypergraph-based_Evolutionary_Design_System&amp;diff=2512&amp;oldid=prev"/>
				<updated>2014-12-25T14:17:08Z</updated>
		
		<summary type="html">&lt;p&gt;‎&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;Used References&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&#039;diff-marker&#039; /&gt;
				&lt;col class=&#039;diff-content&#039; /&gt;
				&lt;col class=&#039;diff-marker&#039; /&gt;
				&lt;col class=&#039;diff-content&#039; /&gt;
				&lt;tr style=&#039;vertical-align: top;&#039; lang=&#039;de&#039;&gt;
				&lt;td colspan=&#039;2&#039; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Nächstältere Version&lt;/td&gt;
				&lt;td colspan=&#039;2&#039; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Version vom 25. Dezember 2014, 14:17 Uhr&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l98&quot; &gt;Zeile 98:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Zeile 98:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Fundations, World Scientific London (1997)&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Fundations, World Scientific London (1997)&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[18] &lt;del class=&quot;diffchange diffchange-inline&quot;&gt;B. &lt;/del&gt;Strug&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;. &lt;/del&gt;Hierarchical Representation and Operators in Evolutionary Design&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;, &lt;/del&gt;Parallel Processing and&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[18] &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;Barbara &lt;/ins&gt;Strug&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;: &lt;/ins&gt;Hierarchical Representation and Operators in Evolutionary Design&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;. &lt;/ins&gt;Parallel Processing and&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Applied Mathematics (PPAM 2005), LNCS vol 3911, pp. 447-454 Springer 2006.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Applied Mathematics (PPAM 2005), LNCS vol 3911, pp. 447-454 Springer 2006. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;http://link.springer.com/chapter/10.1007%2F11752578_54&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== Links ==&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== Links ==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	<entry>
		<id>http://de.evo-art.org/index.php?title=Hypergraph-based_Evolutionary_Design_System&amp;diff=2508&amp;oldid=prev</id>
		<title>Gbachelier: /* Used References */</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Hypergraph-based_Evolutionary_Design_System&amp;diff=2508&amp;oldid=prev"/>
				<updated>2014-12-25T14:09:29Z</updated>
		
		<summary type="html">&lt;p&gt;‎&lt;span dir=&quot;auto&quot;&gt;&lt;span class=&quot;autocomment&quot;&gt;Used References&lt;/span&gt;&lt;/span&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&#039;diff-marker&#039; /&gt;
				&lt;col class=&#039;diff-content&#039; /&gt;
				&lt;col class=&#039;diff-marker&#039; /&gt;
				&lt;col class=&#039;diff-content&#039; /&gt;
				&lt;tr style=&#039;vertical-align: top;&#039; lang=&#039;de&#039;&gt;
				&lt;td colspan=&#039;2&#039; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Nächstältere Version&lt;/td&gt;
				&lt;td colspan=&#039;2&#039; style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Version vom 25. Dezember 2014, 14:09 Uhr&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l92&quot; &gt;Zeile 92:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Zeile 92:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;New York (2000).&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;New York (2000).&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[16] P. Nikodem and B. Strug&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;. &lt;/del&gt;Graph Transformations in Evolutionary Design&lt;del class=&quot;diffchange diffchange-inline&quot;&gt;, &lt;/del&gt;Lecture Notes in Computer&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[16] P. Nikodem and B. Strug&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;: &lt;/ins&gt;Graph Transformations in Evolutionary Design&lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;. Artificial Intelligence and Soft Computing - ICAISC 2004 &lt;/ins&gt;Lecture Notes in Computer&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Science,vol 3070, pp. 456-461, Springer, 2004.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;+&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Science,vol 3070, pp. 456-461, Springer, 2004. &lt;ins class=&quot;diffchange diffchange-inline&quot;&gt;http://link.springer.com/chapter/10.1007%2F978-3-540-24844-6_67&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[17] Rozenberg, G. Handbook of Graph Grammars and Computing by Graph. Transformations, vol.1&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[17] Rozenberg, G. Handbook of Graph Grammars and Computing by Graph. Transformations, vol.1&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l100&quot; &gt;Zeile 100:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Zeile 100:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[18] B. Strug. Hierarchical Representation and Operators in Evolutionary Design, Parallel Processing and&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;[18] B. Strug. Hierarchical Representation and Operators in Evolutionary Design, Parallel Processing and&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Applied Mathematics (PPAM 2005), LNCS vol 3911, pp. 447-454 Springer 2006.&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;Applied Mathematics (PPAM 2005), LNCS vol 3911, pp. 447-454 Springer 2006.&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;−&lt;/td&gt;&lt;td style=&quot;color:black; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;del style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/del&gt;&lt;/div&gt;&lt;/td&gt;&lt;td colspan=&quot;2&quot;&gt;&amp;#160;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== Links ==&lt;/div&gt;&lt;/td&gt;&lt;td class=&#039;diff-marker&#039;&gt;&amp;#160;&lt;/td&gt;&lt;td style=&quot;background-color: #f9f9f9; color: #333333; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #e6e6e6; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;== Links ==&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	<entry>
		<id>http://de.evo-art.org/index.php?title=Hypergraph-based_Evolutionary_Design_System&amp;diff=2498&amp;oldid=prev</id>
		<title>Gbachelier: Die Seite wurde neu angelegt: „== Reference == E. Grabska, B. Strug, G. Ślusarczyk: Hypergraph-based Evolutionary Design System. In: Generative Art 2007.   == DOI ==  == Abstract ==…“</title>
		<link rel="alternate" type="text/html" href="http://de.evo-art.org/index.php?title=Hypergraph-based_Evolutionary_Design_System&amp;diff=2498&amp;oldid=prev"/>
				<updated>2014-12-25T13:41:48Z</updated>
		
		<summary type="html">&lt;p&gt;Die Seite wurde neu angelegt: „== Reference == E. Grabska, B. Strug, G. Ślusarczyk: &lt;a href=&quot;/index.php?title=Hypergraph-based_Evolutionary_Design_System&quot; title=&quot;Hypergraph-based Evolutionary Design System&quot;&gt;Hypergraph-based Evolutionary Design System&lt;/a&gt;. In: &lt;a href=&quot;/index.php?title=Generative_Art_2007&quot; title=&quot;Generative Art 2007&quot;&gt;Generative Art 2007&lt;/a&gt;.   == DOI ==  == Abstract ==…“&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Neue Seite&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Reference ==&lt;br /&gt;
E. Grabska, B. Strug, G. Ślusarczyk: [[Hypergraph-based Evolutionary Design System]]. In: [[Generative Art 2007]]. &lt;br /&gt;
&lt;br /&gt;
== DOI ==&lt;br /&gt;
&lt;br /&gt;
== Abstract ==&lt;br /&gt;
This paper deals with applying evolutionary methods in computer aided design. The&lt;br /&gt;
design process is an iterative one consisting of several steps. It starts with a preliminary&lt;br /&gt;
or conceptual design, which is then analyzed or tested in order to find out which of its&lt;br /&gt;
elements must be redesigned or refined. The process of evaluation and optimization is&lt;br /&gt;
repeated until an acceptable solution is found. Since designing can be treated in&lt;br /&gt;
computer science as a search process, where all possible designs form a search space,&lt;br /&gt;
it is possible to use search techniques such as evolutionary ones.&lt;br /&gt;
&lt;br /&gt;
As evolutionary search consists in evaluating and refining possible solutions, it can be&lt;br /&gt;
seen as analogous to a human design iterative process of analysis, testing and&lt;br /&gt;
optimization. Similarly to the refinement step in human design, in evolutionary search&lt;br /&gt;
designs to be transformed are determined according to their evaluation (fitness). The&lt;br /&gt;
refinement step is often performed not on actual solutions (phenotypes) but on their&lt;br /&gt;
coded equivalents (genotypes).&lt;br /&gt;
&lt;br /&gt;
Since in design problems genotypes in the form of binary strings are very often&lt;br /&gt;
insufficient we propose to use a graph-based representation of genotypes which enables&lt;br /&gt;
us not only to express geometrical properties of an object but also its attributes (like&lt;br /&gt;
color, material etc.) and relations between object components.&lt;br /&gt;
&lt;br /&gt;
In this paper we adopt hierarchical hypergraphs as they can represent an artifact with&lt;br /&gt;
both multi-argument relations and hierarchical dependence which are impossible to&lt;br /&gt;
express by other structures. The greatest advantage of this representation is its ability to&lt;br /&gt;
describe in a uniform way all types of relations and objects and to produce highly fitted&lt;br /&gt;
individuals.&lt;br /&gt;
&lt;br /&gt;
Using hypergraphs in an evolutionary search requires the adaptation of traditional&lt;br /&gt;
evolutionary operators like cross-over and mutation. As the hypergraphs selected to be&lt;br /&gt;
transformed by the evolutionary operators at the subsequent stage of the evolution and&lt;br /&gt;
their structures are not known a priori the operator must be defined in a way which&lt;br /&gt;
allows for an &amp;quot;online&amp;quot; computation of new hypergraphs. Genetic operators working on&lt;br /&gt;
hypergraphs and the structure of an evolutionary design system is presented.&lt;br /&gt;
The method is illustrated by examples of floor-layouts generated by a house design&lt;br /&gt;
system, where structures of floor-layouts are represented by hypergraphs. In our&lt;br /&gt;
approach a cross-over operation exchanges subgraphs representing the functional &lt;br /&gt;
areas with different internal arrangements, while mutation affects local and global&lt;br /&gt;
attributes as well as the graph structure (by adding or deleting subgraphs)&lt;br /&gt;
&lt;br /&gt;
== Extended Abstract ==&lt;br /&gt;
&lt;br /&gt;
== Bibtex == &lt;br /&gt;
&lt;br /&gt;
== Used References ==&lt;br /&gt;
[1] P. J. Bentley, Generic Evolutionary Design of Solid Objects using a Genetic Algorithm, PhD thesis,&lt;br /&gt;
UCL London 1), 3-38, (1997).&lt;br /&gt;
&lt;br /&gt;
[2] Borkowski A., Grabska E., Nikodem P, and Strug B., Searching for Innovative Structural Layouts by&lt;br /&gt;
Means of Graph Grammars and Evolutionary Optimization,, Proc. 2nd Int. Structural Eng. And Constr.&lt;br /&gt;
Conf, Rome, (2003).&lt;br /&gt;
&lt;br /&gt;
[3] De Jong K, Arciszewski T, and Vyas H, An Overview of Evolutionary Computation and its Applications,&lt;br /&gt;
in. Artificial Intelligence in Engineerig,9-22, Warsaw, (1999).&lt;br /&gt;
&lt;br /&gt;
[4] D.E.Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA,&lt;br /&gt;
Addison-Wesley, (1989).&lt;br /&gt;
&lt;br /&gt;
[5] E. Grabska. A. Lachwa, G. Slusarczyk, K. Grzesiak-Kopec and J. Lembas; Hierarchical Layout&lt;br /&gt;
Hypergraph Operations and Diagrammatic Reasoning, Machine GRAPHICS and VISION, (in print)&lt;br /&gt;
&lt;br /&gt;
[6] E.Grabska,Theoretical Concepts of Graphical Modelling. Part one: Realization of CP-graphs. Machine&lt;br /&gt;
GRAPHICS and VISION, 2(1993).&lt;br /&gt;
&lt;br /&gt;
[7] Grabska, E.. Graphs and designing. Lecture Notes in Computer Science, 776 (1994).&lt;br /&gt;
&lt;br /&gt;
[8] E.Grabska, W. Palacz, Hierarchical graphs in creative design. Machine GRAPHICS and VISION,&lt;br /&gt;
9(1/2), 115-123. (2000).&lt;br /&gt;
&lt;br /&gt;
[9] Hajela P. and Lee, J, Genetic Algorith in Truss Topological OpJournal of Solids and Structures vol.32,&lt;br /&gt;
no 22 , 3341-3357, (1995).&lt;br /&gt;
&lt;br /&gt;
[10] Hoffman, C. M.,Geometric and Solid Modeling: An Introduction, Morgan Kaufmann, San Francisco,&lt;br /&gt;
CA, (1989).&lt;br /&gt;
&lt;br /&gt;
[11]Holland, J. H. Adaptation in Natural and Artificial Systems, Ann Arbor, (1975).&lt;br /&gt;
&lt;br /&gt;
[12] Mantyla, M.,An Introduction To Solid Modeling, Computer Science Press, Rockville,MD,vol.87,&lt;br /&gt;
(1988).&lt;br /&gt;
&lt;br /&gt;
[13] Martin, R R and Stephenson, P C Sweeping of Three-dimensional Objects? Computer Aided Design&lt;br /&gt;
Vol 22(4) (1990), pp. 223-234.&lt;br /&gt;
&lt;br /&gt;
[14] Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin&lt;br /&gt;
Heidelberg New York (1996).&lt;br /&gt;
&lt;br /&gt;
[15] Michalewicz, Z. Fogel, D. B.: How to Solve It: Modern Heuristics.. Springer-Verlag, Berlin Heidelberg&lt;br /&gt;
New York (2000).&lt;br /&gt;
&lt;br /&gt;
[16] P. Nikodem and B. Strug. Graph Transformations in Evolutionary Design, Lecture Notes in Computer&lt;br /&gt;
Science,vol 3070, pp. 456-461, Springer, 2004.&lt;br /&gt;
&lt;br /&gt;
[17] Rozenberg, G. Handbook of Graph Grammars and Computing by Graph. Transformations, vol.1&lt;br /&gt;
Fundations, World Scientific London (1997)&lt;br /&gt;
&lt;br /&gt;
[18] B. Strug. Hierarchical Representation and Operators in Evolutionary Design, Parallel Processing and&lt;br /&gt;
Applied Mathematics (PPAM 2005), LNCS vol 3911, pp. 447-454 Springer 2006.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Links ==&lt;br /&gt;
=== Full Text === &lt;br /&gt;
http://www.generativeart.com/on/cic/papersGA2007/04.pdf&lt;br /&gt;
&lt;br /&gt;
[[intern file]]&lt;br /&gt;
&lt;br /&gt;
=== Sonstige Links ===&lt;/div&gt;</summary>
		<author><name>Gbachelier</name></author>	</entry>

	</feed>