Difference between revisions of "Software self-assembly"
| Line 1: | Line 1: | ||
| − | This article will discuss the topic of self-assembling software. | + | This article will discuss the topic of self-assembling software. |
| − | In 2008 appeared the first PhD thesis-es related to software self-assembly. In [[Automated self-assembly programming paradigm]] Lin Li uses a self-assembly algorithm combined with genetic algorithms to generate the code | + | In 2008 appeared the first PhD thesis-es related to software self-assembly. In [[Automated self-assembly programming paradigm]] Lin Li uses a self-assembly algorithm combined with genetic algorithms to generate the code for insertion, bubble and selection sort from it's fragment component statements. The components are considered like an ideal gas with a temperature. The components vibrate in a mesh till they find a minimum energy configuration. Second order structures appear. |
In the same year Yuriy Brun in his thesis [[Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized distributed networks]] investigated the solving of the SAT problem on distributed networks. | In the same year Yuriy Brun in his thesis [[Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized distributed networks]] investigated the solving of the SAT problem on distributed networks. | ||
Revision as of 11:38, 27 May 2014
This article will discuss the topic of self-assembling software.
In 2008 appeared the first PhD thesis-es related to software self-assembly. In Automated self-assembly programming paradigm Lin Li uses a self-assembly algorithm combined with genetic algorithms to generate the code for insertion, bubble and selection sort from it's fragment component statements. The components are considered like an ideal gas with a temperature. The components vibrate in a mesh till they find a minimum energy configuration. Second order structures appear.
In the same year Yuriy Brun in his thesis Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized distributed networks investigated the solving of the SAT problem on distributed networks.
More recently in 2011 Luca Cavallaro defines service tiles as a generalization of Wang tiles and combines web services based on minimizing cost using integer logic programming in his work: A Tile-based Approach for Self-assembling Service Compositions.
