Showing 1 - 9 of 9
We study the simple evolutionary process in which we repeatedly find the least fit agent in a population of agents and give it a new fitness which is chosen independently at random from a specified distribution. We show that many of the average properties of this process can be calculated...
Persistent link: https://www.econbiz.de/10005260362
Phage display, SELEX and other methods of combinatorial chemistry have become very popular means of finding ligands with high affinities to given targets. Despite their success, they suffer from numerous sources of error and bias, such as very low initial concentrations of species, non-specific...
Persistent link: https://www.econbiz.de/10005790639
Highly optimized tolerance is a model of optimization in engineered systems, which gives rise to power …
Persistent link: https://www.econbiz.de/10005790761
evolutionary optimization. …
Persistent link: https://www.econbiz.de/10005790850
Technological change at the firm level has commonly been modeled as random sampling from a fixed distribution o f possibilities. Such models, however, typically ignore empirically important aspects of the firm's search process, notably the observation that the present state of the firm guides...
Persistent link: https://www.econbiz.de/10005791001
the dynamics of the optimization process. This results in a non-linear relation between the fraction of tertiary … results have important implications for evolutionary optimization in biopolymers, in particular the evolution of viruses. …
Persistent link: https://www.econbiz.de/10005791065
Army ant colonies display complex foraging raid patterns involving thousands of individuals communicating through chemical trails. In this paper we explore, by means of a simple search algorithm, the properties of these trails in order to test the hypothesis that their structure reflects an...
Persistent link: https://www.econbiz.de/10005791067
, 1995) and Gambardella et al.}(1997) have proposed a remarkable optimization method, Ant Colony Optimization (ACO), which … they applied to classical NP-hard combinatorial optimization problems, such as the traveling salesman problem (Lawler et al …
Persistent link: https://www.econbiz.de/10005739934
origin of these topologies use growing graphs, here we show that a simple optimization process can also account for the …
Persistent link: https://www.econbiz.de/10005739984