نتایج جستجو برای: hierarchical location
تعداد نتایج: 314805 فیلتر نتایج به سال:
Many existing location sharing applications provide coordinate-based location estimates and display them on a map. However, people use a rich variety of terms to convey their location to others, such as “home,” “Starbucks,” or even “the bus stop near my apartment.” Our long-term goal is to create a system that can automatically generate useful place names based on real-time context. Towards thi...
Mobile satellite systems are a crucial component of the future global telecommunications infrastructure. An important aspect of the future system is to manage the location of both users and satellites. This paper presents a strategy for location registration (update) and paging in Low Earth Orbit (LEO) mobile satellite systems. First, we discuss the tradeoff that exists between four proposed sa...
We discuss the approach to investigation of molecular machines using systems of integro– differential ultrametric (p-adic) reaction–diffusion equations with drift. This approach combines the features of continuous and discrete dynamic models. We apply this model to investigation of actomyosin molecular motor. The introduced system of equations is solved analytically using p-adic wavelet theory....
This paper introduces a flexible new method of constructing hierarchical multicast structures suitable for supporting large-scale GRID applications. Hierarchical multicast trees are constructed by repeated application of clustering algorithms that partition the members of a large application community to form a layered hierarchy of clusters of users. The hierarchies are examples of application ...
We present four eecient heuristics (one basic scheme and three of its variants) to predict the location of a mobile user in the cellular mobile environment. The proposed location management schemes assume a hierarchy of location areas, which might change dynamically with changing traac patterns. A method to compute this hierarchical tree is also proposed. Depending on the proole of the user mov...
We give a new randomized LP-rounding 1.725-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Swamy & Shmoys. To the best of our knowledge, our work provides the first application of a dependent-rounding technique in the domain of facility location. The analysis of our algorit...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید