نتایج جستجو برای: multi-path
تعداد نتایج: 593427 فیلتر نتایج به سال:
multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. in this paper, a new clustering based multi path routingprotocol namely ecrr (energy efficient cluster based routing algorithm for improving reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required qos ...
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
the problem of finding the minimum cost multi-commodity flow in an undirected and completenetwork is studied when the link costs are piecewise linear and convex. the arc-path model and overflowmodel are presented to formulate the problem. the results suggest that the new overflow model outperformsthe classical arc-path model for this problem. the classical revised simplex, frank and wolf and a ...
The canonical multi-path NUM model which is extended directly from the single-path NUM has been studied widely in the literature. Most of the previous approaches do not specify the case of subflows on paths with different characteristics. Moreover, the transport protocol derived from the canonical multi-path NUM exhibits flappiness in the subflows because of the non-strictly convexity of the op...
Multi-agent path planning (MAPP) is the problem of collision-free trajectories from start to goal locations for a team agents. This work explores relatively unexplored setting MAPP where streams agents have go through starts and goals with high throughput. We tackle this by formulating new variant called periodic in which timing agent appearances periodic. The objective find plan, set that can ...
The high-level contribution of this paper is a simulation-based analysis to evaluate the tradeoffs between lifetime and hop count of link-disjoint, node-disjoint and zone-disjoint multi-path routes vis-à-vis singlepath minimum hop routes for mobile ad hoc networks. The link-disjoint, node-disjoint and zone-disjoint algorithms proposed in this paper can be used to arrive at benchmarks for the ti...
یکی از مهم ترین معایب فیلتر های n مسیره تازدگی هارمونیکی (hfb) می باشد. یعنی بعضی از هارمونیک های فرکانس سوئیچینگ (fs) می توانند با تبدیل فرکانسی ، مولفه هایی را در باند عبور فیلتر ایجاد کنند. در این پایان نامه روشی سیستماتیک ارائه شده است تا بدون افزایش فرکانس کلاک مرجع ورودی (clkin)، مشکل تازدگی هارمونیکی فیلترهای n مسیره کاهش یابد. برای دستیابی به این هدف، ابتدا تازدگی هارمونیکی در یک فیلتر ...
Conventional multi-agent path planners typically determine a that optimizes single objective, such as length. Many applications, however, may require multiple objectives, say time-to-completion and fuel use, to be simultaneously optimized in the planning process. Often, these criteria not readily compared sometimes lie competition with each other. Simply applying standard multi-objective search...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید