نتایج جستجو برای: resolving set
تعداد نتایج: 680802 فیلتر نتایج به سال:
In the rst part of this paper I discussed two central notions concerning questions, aboutness and resolvedness, and proposed an analysis of these notions which I used to provide a situation semantics account for both query and embedded uses of interrogatives (seèResolving Questions, I' for discussion and for the notation assumed below; all sections numbered 5.x and less are in part I.). In this...
Let G = (V,E) be a connected graph (or hypergraph) and let d(x, y) denote the distance between vertices x, y ∈ V (G). A subset W ⊆ V (G) is called a resolving set for G if for every pair of distinct vertices x, y ∈ V (G), there is w ∈ W such that d(x,w) 6= d(y, w). The minimum cardinality of a resolving set for G is called the metric dimension of G, denoted by β(G). In this paper we determine t...
Service organizations frequently implement improvement programs to increase quality. These programs often rely on employees’ suggestions about improvement opportunities. Organizations face a trade-off with such suggestion-driven improvement programs. On one hand, the improvement literature recommends that managers focus organizational resources on surfacing a large number of problems, prioritiz...
Conflict in multi-agent systems is ubiquitous. Research often focuses on the process of resolving conflicts between different agents. We call this the inter-agent conflict resolution process. However, in complex problem solving agents the process of resolving conflicts with other agents impacts local problem solving as well as deals made with other agents. This leads to the need for an intra-ag...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید