Difference between revisions of "Software self-assembly"

From self-assembly wiki
Jump to navigation Jump to search
 
(4 intermediate revisions by 3 users not shown)
Line 1: Line 1:
This article will discuss the topic of self-assembling software. More info coming soon!
+
In 2008 the first PhD theses related to software self-assembly appeared. 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 fragment-component statements. The components are considered like an ideal gas. The components vibrate in a mesh until minimum energy is reached and a second order structure appears.
==Topic Content==
 
*[[:Category:thesis|List of thesis-es]]
 
  
*[[Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized 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 solving the SAT problem on distributed networks.
*[[A Tile-based Approach for Self-assembling Service Compositions]]
+
 
*[[Automated self-assembly programming paradigm]]
+
In 2011 Luca Cavallaro defined service tiles as a generalization of Wang tiles and combined web services based on minimizing cost using integer logic programming in his work:
 +
[[A Tile-based Approach for Self-assembling Service Compositions]].
  
 
[[Category:self-assembly]]
 
[[Category:self-assembly]]

Latest revision as of 10:59, 27 May 2014

In 2008 the first PhD theses related to software self-assembly appeared. 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 fragment-component statements. The components are considered like an ideal gas. The components vibrate in a mesh until minimum energy is reached and a second order structure appears.

In the same year Yuriy Brun in his thesis Self-assembly for discreet, fault-tolerant and scalable computation on internet-sized distributed networks investigated solving the SAT problem on distributed networks.

In 2011 Luca Cavallaro defined service tiles as a generalization of Wang tiles and combined web services based on minimizing cost using integer logic programming in his work: A Tile-based Approach for Self-assembling Service Compositions.