ON REALIZING THE SHORTEST TIME STRATEGY IN A CA FF PEDESTRIAN DYNAMICS MODEL

Author： Kirik Ekaterina   Yurgel'yan Tat'yana   Krouglov Dmitriy  

Publisher： Taylor & Francis Ltd

ISSN： 1087-6553

Source： Cybernetics and Systems, Vol.42, Iss.1, 2011-01, pp. : 1-15

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

VALIDATION OF CA MODELS OF PEDESTRIAN DYNAMICS WITH FUNDAMENTAL DIAGRAMS

By Schadschneider A.   Seyfried A.  

Cybernetics and Systems, Vol. 40, Iss. 5, 2009-07 ,pp. : 367-389

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the Complexity of Time-Dependent Shortest Paths

By Foschini Luca   Hershberger John   Suri Subhash  

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 1075-1097

Springer Publishing Company

Access to resources Recommend Favorite

Shortest consistent superstrings computable in polynomial time

By Jiang T.   Timkovsky V.G.  

Theoretical Computer Science, Vol. 143, Iss. 1, 1995-07 ,pp. : 113-122

Elsevier

Access to resources Recommend Favorite

Optimal multitherapy strategy in mathematical model of dynamics of the number of nonuniform tumor cells

By Antipov A.  

Journal of Computer and Systems Sciences International, Vol. 50, Iss. 3, 2011-06 ,pp. : 499-510

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Realizing the NOSHAPE MAS Organizational Model: An Operational View

By  

International Journal of Agent Technologies and Systems (IJATS), Vol. 7, Iss. 2, 2015-04 ,pp. : 75-104

IGI Global_journal

Access to resources Recommend Favorite