نتایج جستجو برای: probabilistic routes
تعداد نتایج: 101342 فیلتر نتایج به سال:
We present a probabilistic proactive rebalancing method and speed-up techniques for improving the performance of state-of-the-art real-time high-capacity fleet management framework. improve on both computational efficiency system performance. The include search-space pruning I/O cost reduction parallelization, reducing computation time by up to 97.67%, in experiments taxi trips New York City. r...
in this paper, we formalize the menger probabilistic normed space as a category in which its objects are the menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. so, we can easily apply the results of topological vector spaces...
in this paper, we introduce the probabilistic normed groups. among other results, we investigate the continuityof inner automorphisms of a group and the continuity of left and right shifts in probabilistic group-norm. we also study midconvex functions defined on probabilistic normed groups and give some results about locally boundedness of such functions.
introduction and aims: until today human stomach is the only recognized habitat of h. pylori . however, recruitment of dna-based methods has made possible the detection of h. pylori in water and oral cavity, thus suggesting faecal-oral and oral-oral routes for transmission of h. pylori , respectively. in this study yeast has been proposed as a common vector for transmission of h. pylori . thus ...
Distributed robot systems have been adopted lately for security purposes, such as in automatic multirobot patrolling of infra-structures. Research has shown that deterministic patrol routes can lead to effective performance. However, they can potentially be predicted by intelligent intruders. This work presents a probabilistic multi-robot patrolling strategy, where each autonomous agent uses Ba...
In this paper, we define the concepts of modified intuitionistic probabilistic metric spaces, the property (E.A.) and the common property (E.A.) in modified intuitionistic probabilistic metric spaces.Then, by the commonproperty (E.A.), we prove some common fixed point theorems in modified intuitionistic Menger probabilistic metric spaces satisfying an implicit relation.
We describe a simple online heuristic for scheduling job shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N , on each route. The heuristic uses safety stocks and keeps the bottleneck machine busy at almost all times, while the other machines are paced by the bottleneck machine. We perform a probabilistic analysis of the heuristic, under some assumptions on the di...
We propose a heuristic for VLSI interconnect global routing that can optimize routing congestion delay and number of bends which are often competing objectives Routing exibilities under timing constraints are obtained and exploited to reduce congestion subject to timing constraints The wire routes are determined through gradual re nement according to probabilistic estimation on congestions so t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید