Related papers: Noncooperative algorithms in self-assembly
RecentadvancesinDistributedComputinghighlightmodelsandalgo- rithms for autonomous swarms of mobile robots that self-organize and cooperate to solve global objectives. The overwhelming majority of works so far considers handmade algorithms…
Both biological and artificial self-assembly processes can take place by a range of different schemes, from the successive addition of identical building blocks, to hierarchical sequences of intermediates, all the way to the fully…
We are entering a new era in which software systems are becoming more and more complex and larger. So, the composition of such systems is becoming infeasible by manual means. To address this challenge, self-organising software models…
In this paper we discuss the results recently published in~[1] about algebraic signal models (ASMs) based on non commutative algebras and their use in convolutional neural networks. Relying on the general tools from algebraic signal…
We define the Reflexive Tile Assembly Model (RTAM), which is obtained from the abstract Tile Assembly Model (aTAM) by allowing tiles to reflect across their horizontal and/or vertical axes. We show that the class of directed temperature-1…
This paper considers the problem of completing assemblies of passive objects in nonconvex environments, cluttered with convex obstacles of unknown position, shape and size that satisfy a specific separation assumption. A differential drive…
Modern experimental methods enable the creation of self-assembly building blocks with tunable interactions, but optimally exploiting this tunability for the self-assembly of desired structures remains an important challenge. Many studies of…
Automated service composition as the process of creating new software in an automated fashion has been studied in many different ways over the last decade. However, the impact of automated service composition has been rather small as its…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
Most existing 3D assembly methods treat the problem as pure pose estimation, rearranging observed parts via rigid transformations. In contrast, human assembly naturally couples structural reasoning with holistic shape inference. Inspired by…
In the constrained planarity setting, we ask whether a graph admits a planar drawing that additionally satisfies a given set of constraints. These constraints are often derived from very natural problems; prominent examples are Level…
In the context of self-assembly, where complex structures can be assembled from smaller units, it is desirable to devise strategies towards disassembly and reassembly processes that reuse the constituent parts. A non-reciprocal multifarious…
The scalability of massively parallel algorithms is a fundamental question in computer science. We study the scalability and the efficiency of a conservative massively parallel algorithm for discrete-event simulations where the discrete…
We present a series of results related to mathematical models of self-assembling tiles and the impacts that three diverse properties have on their dynamics. We expand upon a series of prior results which showed that (1) the abstract Tile…
Self-assembly of complex and functional materials remains a grand challenge in soft material science. Efficient assembly depends on a delicate balance between thermodynamic and kinetic effects, requiring fine-tuning affinities and…
The ability to control forces between sub-micron-scale building blocks offers considerable potential for designing new materials through self-assembly. A typical paradigm is to first identify a particular (crystal) structure that has some…
The field of algorithmic self-assembly is concerned with the design and analysis of self-assembly systems from a computational perspective, that is, from the perspective of mathematical problems whose study may give insight into the natural…
Self-assembly is the autonomous organization of components into patterns or structures: an essential ingredient of biology and a desired route to complex organization. At equilibrium, the structure is encoded through specific interactions,…
This paper deals with simultaneously fast and in-place algorithms for formulae where the result has to be linearly accumulated: some of the output variables are also input variables, linked by a linear dependency. Fundamental examples…
The design and implementation of parallel algorithms is a fundamental task in computer algebra. Combining the computer algebra system Singular and the workflow management system GPI-Space, we have developed an infrastructure for massively…