نتایج جستجو برای: dijkstra method
تعداد نتایج: 1630888 فیلتر نتایج به سال:
Dijkstra and van Heuven have made an admirable attempt to develop a new model of bilingual memory, the BIA+. Their article presents a clear and well-reasoned theoretical justification of their model, followed by a description of their model. The BIA+ is, as the name implies, an extension of the Bilingual Interactive Activation (BIA) model (Dijkstra & van Heuven, 1998; Van Heuven, Dijkstra & Gra...
The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In our algorithm, vertices of the same group of surface types are allowed to join a segment. The geodesic distance is estimated using shortest path between connected vertices, which can be computed from well known algorithm...
Pieter Simon Dijkstra (1884-1968) is regarded as a noted Protestant church designer in South Africa, but his contribution to the built environment Netherlands much less well known. His life and career country of birth are interest because they closely aligned with religious turbulence period, which anti-revolutionary clergyman-politician Abraham Kuyper played prominent role. The building new Re...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید