LOADING CONTAINERS WITH ANTS
نویسندگان
چکیده
منابع مشابه
Sub-micron Vaterite Containers: Synthesis, Substance Loading, and Release**
Promising candidates for the development of universal nanoscale delivery systems are porous inorganic nanoparticles. Recently, the applications of porous silicon in a multistage delivery system, in polymer coated nanocarriers, and of porous silica as core material for lipid bilayers have attracted great attention. A system with similarly high potential, but less studied so far, is porous calciu...
متن کاملOvercoming Obstacles with Ants
Consider a group of mobile finite automata, referred to as agents, located in the origin of an infinite grid. The grid is occupied by obstacles, i.e., sets of cells that can not be entered by the agents. In every step, an agent can sense the states of the co-located agents and is allowed to move to any neighboring cell of the grid not blocked by an obstacle. We assume that the circumference of ...
متن کاملQuery Routing with Ants?
In this paper we propose SemAnt, a novel ant-based algorithm designed for query routing in taxonomy-based peer-to-peer environments. We introduce the reader to the pheronome trail-laying-andfollowing behaviour observed from natural ants and show how it can be applied to query routing in peer-to-peer networks. Our proposed algorithm accounts for network parameters such as bandwidth and latency a...
متن کاملRiding with the ants
Isolates of Teratosphaeriaceae have frequently been found in the integument of attine ants, proving to be common and diverse in this microenvironment. The LSU phylogeny of the ant-isolated strains studied revealed that they cluster in two main lineages. The first was associated with the genus Xenopenidiella whereas the other represented two ant-isolated lineages sister to the taxa Penidiella ag...
متن کاملACOPlan: Planning with Ants
In this paper an application of the meta–heuristic Ant Colony Optimization to optimal planning is presented. It is well known that finding out optimal solutions to planning problem is a very hard computational problem. Approximate methods do not guarantee either optimality or completeness, but it has been proved that in many applications they are able to find very good solutions, often close to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Modern Physics: Conference Series
سال: 2012
ISSN: 2010-1945,2010-1945
DOI: 10.1142/s201019451200548x