نتایج جستجو برای: in many organizations
تعداد نتایج: 17014111 فیلتر نتایج به سال:
Let A = {a1, a2, . . . , as} and {b1, b2, . . . , bt} with s+r = n, the many to many point matching with demands and capacities matches each point ai ∈ A to at least αi and at most α ′ i points in B, and each point bj ∈ B to at least βj and at most β ′j points in A for all 1 ≤ i ≤ s and 1 ≤ j ≤ t. In this paper, we present an O(n) time and O(n) space algorithm for this problem.
you cannot find any modern society without organizations. all societies need the organizations for achieving their diverse goals. modern professional organizations are doing many functions for their host societies such as: producing and distributing high quality products, provision of health, education, recreation and entertainment services, security and safety. the specialized organizations co...
Nowadays, outsourcing of the organizational activities is fallowed by many of the organizations to preserve their competitive advantages in the international market and also to reduce the investment risks. Most of the famous firms in the world have outsourced parts of their activities on the basis of competitive advantages.Outsourcing is a strategic action, just if it aligns with the organiza-t...
To navigate many-to-many mappings between referents and linguistic expressions, listeners need to calibrate likelihood estimates for different referential expressions taking into account both the context and speaker-specific variation. Focusing on speaker variation, we present three experiments. Experiment 1 establishes that listeners generalize speakerspecific patterns of pre-nominal modificat...
In 1977, L. Berman and J. Hartmanis [BH77] conjectured that all polynomialtime many-one complete sets for NP are are pairwise polynomially isomorphic. It was stated as an open problem in [LM99] to resolve this conjecture under the measure hypothesis from quantitative complexity theory. In this paper we study the polynomial-time isomorphism degrees within degm(SAT ) in the context of polynomial ...
methodology non-native participants in this study were sixty ba students majoring in english literature and teaching english as a foreign language at khayyam university of mashhad. they were senior students, between 21 to 24 years old, who had studied english for at least three and a half years and had passed several courses including grammar, reading, conversation, and writing. this was assum...
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the generic object recognition task where, for example, a collection of features at one scale (in one image) may correspond to a single feature at a coarser scale (in the second image). Generic object recognition therefore req...
Semantic matching is a fundamental step in implementing data sharing applications. Most systems automating this task however limit themselves to finding simple (one-to-one) matching. In fact, complex (many-to-many) matching raises a far more difficult problem as the search space of concept combinations is often very large. This article presents Indigo, a system discovering complex matching in t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید