... A--simple tree-type labyrinth; B--tree-type labyrinth containing cycles filled with gray color , C--complicated labyrinth containing cycles and arbitrary numbers of starting and target points. i The information-processing system based on reactiondiffusion ...
[
Текст
]
Ссылки http://polly.phys.msu.ru/~rambidi/shortest%20path%20in%20a%20labirinth.PDF -- 526.3 Кб -- 21.11.2005 Похожие документы
... Good Solvents 3) Bezkorovaynaya O. Conformational Sampling with Coarse-Grained Peptide Models 4) Dolgushev M. Dynamics of semiflexible tree-like networks 5) Gribova N. Colloids confined in a slit pore: from 2D to 3D behaviour 6) Lyubimov I. Rescaling the ...
[
Текст
]
Ссылки http://polly.phys.msu.ru/conference/workshop2010/workshop_Moscow2010_sci-prog.pdf -- 24.6 Кб -- 28.05.2010 Похожие документы
... This workshop is already the third one initiated by the collaboration of groups in Mainz and Moscow. ... Moscow , Russia ), Effects of polydispersity in the dynamics of polymer blends 30) A. Likhtman (Reading, UK), Microscopic definition of...
[
Текст
]
Ссылки http://polly.phys.msu.ru/conference/workshop2010/workshop_Moscow2010_2nd-announcement.pdf -- 39.6 Кб -- 27.04.2010 Похожие документы
... FIGURE 7 Finding the shortest paths in a tree-type labyrinth:L1-L4 are consecutive steps of the labyrinth evolution in the process of wave spreading, L1-1 is the step L1 after spreading the wave from the labyrinth output, L1-2 is the result of subtracting ...
[
Текст
]
Ссылки http://polly.phys.msu.ru/~rambidi/image%20processing%201.pdf -- 1073.6 Кб -- 21.11.2005 Похожие документы