Results 1 
4 of
4
Automated Tile Design for SelfAssembly Conformations
, 2005
"... SelfAssembly is a powerful autopoietic mechanism ubiquitous throughout the natural world. It may be found at the molecular scale and also at astronomical scales. Selfassembly power lays in the fact that it is a distributed, notnecessarily synchronous, control mechanism for the bottomup manufactu ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
SelfAssembly is a powerful autopoietic mechanism ubiquitous throughout the natural world. It may be found at the molecular scale and also at astronomical scales. Selfassembly power lays in the fact that it is a distributed, notnecessarily synchronous, control mechanism for the bottomup manufacture of complex systems. Control of the assembly process is shared across a myriad of elemental components, none of which has either the storage or the computation capabilities to know and follow a master plan for the assembly of the intended system. In this paper we present an evolutionary algorithm which is capable of programming the so called "Wang Tiles" for the selfassembly of twodimensional squares.
Calculation of Stability . . .
, 1997
"... We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a minsum or min{max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results to th ..."
Abstract
 Add to MetaCart
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a minsum or min{max objective function. Our algorithms run in polynomial time if the optimization problem itself is polynomially solvable. We also extend our results to the tolerance approach to sensitivity analysis.
88 Algorithmic and Mathematical Foundations of the Artificial Intelligence SEQUENCING JOBS WITH UNCERTAIN PROCESSING TIMES AND MINIMIZING THE WEIGHTED TOTAL FLOW TIME
"... Abstract: We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is ..."
Abstract
 Add to MetaCart
Abstract: We consider an uncertain version of the scheduling problem to sequence set of jobs J on a single machine with minimizing the weighted total flow time, provided that processing time of a job can take on any real value from the given closed interval. It is assumed that job processing time is unknown random variable before the actual occurrence of this time, where probability distribution of such a variable between the given lower and upper bounds is unknown before scheduling. We develop the dominance relations on a set of jobs J. The necessary and sufficient conditions for a job domination may be tested in polynomial time of the number n = J of jobs. If there is no a domination within some subset of set J, heuristic procedure to minimize the weighted total flow time is used for sequencing the jobs from such a subset. The computational experiments for randomly generated singlemachine scheduling problems with n ≤ 700 show that the developed dominance relations are quite helpful in minimizing the weighted total flow time of n jobs with uncertain processing times.
Author manuscript, published in "13th IFAC Symposium on Information Control Problems in Manufacturing, INCOM'2009,
, 2009
"... A generic offline approach for dealing with uncertainty in production systems optimisation ..."
Abstract
 Add to MetaCart
A generic offline approach for dealing with uncertainty in production systems optimisation