Access count of this item: 586

Files in This Item:
File Description SizeFormat 
1551-18.pdf631.83 kBAdobe PDFView/Open
Title: CAN PHYSARUM SOLVE THE SHORTEST PATH PROBLEM MATHEMATICALLY RIGOROUSLY ?(Theory of Biomathematics and its Applications III)
Other Titles: 真性粘菌は最短経路問題を数学的に厳密に解きうるか?(第3回生物数学の理論とその応用)
Authors: MIYAJI, TOMOYUKI
OHNISHI, ISAMU
Author's alias: 宮路, 智行
大西, 勇
Keywords: adaptive network
Physarum polycephalum
shortest path problem
global asymptotic stability
Lyapunov functions
Issue Date: Apr-2007
Publisher: 京都大学数理解析研究所
Journal title: 数理解析研究所講究録
Volume: 1551
Start page: 99
End page: 104
URI: http://hdl.handle.net/2433/80887
Appears in Collections:Theory of Biomathematics and its Applications III

Show full item record

Export to RefWorks


Export Format: 


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.