نتایج جستجو برای: traveling time

تعداد نتایج: 1902676  

2016
John T. Nardini D. M. Bortz

Recent biological research has sought to understand how biochemical signaling pathways, such as the mitogen-activated protein kinase (MAPK) family, influence the migration of a population of cells during wound healing. Fisher’s Equation has been used extensively to model experimental wound healing assays due to its simple nature and known traveling wave solutions. This partial differential equa...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2004
Vicenç Méndez Daniel Campos Sergei Fedotov

The existence of traveling wave front solutions with a minimum speed selected for reaction-dispersal processes is studied. We obtain a general existence condition in terms of the waiting time and dispersal distance probability distribution functions and we detail this result for situations of ecological interest. In particular, when particles disperse according to jumps of short length and any ...

M. R. Hossain, R. N. Mondal, S. K. Saha,

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

1995
YALE T. HERER MICHAL PENN Joseph S. B. Mitchell

Let G = (V, E) be a graph and w: E -» R+ be a length function. Given S C V, a Steiner tour is a cycle passing at least once through each vertex of S . In this paper we investigate naturally submodular graphs: graphs for which the length function of the Steiner tours is submodular. We provide two characterizations of naturally submodular graphs, an 0(n) time algorithm for identifying such graphs...

Journal: :Global Journal of Archaeology & Anthropology 2017

Journal: :Public Transport 2021

Abstract The pilgrimage to Mecca, which is called Hajj, the largest annual pedestrian crowd management problem in world. During pilgrims are accommodated camps. For safety reasons, exact times and directions given who moving between holy sites. Despite importance of complying with those schedules, violations can often be conjectured. Directing a small workforce camps monitor pilgrims’ complianc...

2014
Hsun-Ping Hsieh Cheng-Te Li

In this work, we aim to collectively recommend traveling paths by leveraging the check-in data through mining the moving behaviors of users. We call such traveling paths as Temporal Transit Patterns (TTP), which capture the representative traveling behaviors over consecutive locations, from the big check-in data. To achieve such goal, we propose a novel Temporal Transit Pattern Mining method (T...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید