نتایج جستجو برای: 2 locating set
تعداد نتایج: 3047059 فیلتر نتایج به سال:
Given is a finite set of points, A, on a simple closed curve. Henceforth, point refers to an arbitrary point on the curve, and a point in A is called an anchor. For any two points x, y, the distance between them, d(x, y), is the length of the shorter segment (of the curve) joining x, y. The metric of a point with respect to the given anchors is the sum of the distances between the anchors and t...
The use of wireless Internet networks has increased dramatically in the last several years. From the home to municipal-scale networks, the Service Set Identifier (SSID) plays a significant role in the identity of networks – distinguishing one from another. As the primary tool for network node owners or providers to communicate with potential users, the network name also serves as an indicator o...
A systematic procedure for locating resistive bridges is presented. Critical path tracing is used to identify a set of “suspect” bridges whose presence could explain all of the observed faulty behavior of the circuit for the original test set. The set of suspects is then reduced by adaptively applying additional tests derived from the failing vector pairs in the original test set. Unlike other ...
For a graph G that models a facility, various detection devices can be placed at the vertices so as to identify the location of an intruder such as a thief or saboteur. Here we introduce the open neighborhood locating-dominating set problem. We seek a minimum cardinality vertex set S with the property that for each vertex v its open neighborhood N(v) has a unique non-empty intersection with S. ...
در این پایان نامه رسته کلیسلی setpو رسته ریخت جزئی setمعرفی شده و الحاق هایی بین رسته های set، set وریخت جزئیset بدست آورده ایم. همچنین به مطالعه وجود ضرب ، معادلساز و عقب بر در رسته کلیسلی پرداخته ایم. نشان داده ایم ضرب در این رسته وجود دارد. برای وجود معادلساز شرایط لازم وکافی را بدست آورده و نتیجه را به وجود عقب بر و نهایتاً حد ، بطور کلی تسری داده ایم.
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
location selection is one of the most important activities in establishment of bank branches. choosing a suitable location have a direct impact on the performance of banks and also facilitating the achievement of other objectives. there are a lot of influential factors on the location selection which are complicated and therefore the traditional methods cannot be used. so we need to have a suit...
A locating-dominating set of an undirected graph is a subset vertices S such that dominating and for every u,v?S, the neighbourhood u v on are distinct (i.e. N(u)?S?N(v)?S). Locating-dominating sets have received considerable attention in last decades. In this paper, we consider oriented version problem. each w?V?S, N?(w)?S?? pair u,v?V?S, N?(u)?S?N?(v)?S. We following two parameters. Given G, ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید