نتایج جستجو برای: matching process
تعداد نتایج: 1399144 فیلتر نتایج به سال:
An axiom system ACP lm is presented as a variant of the process algebra ACP (Algebra of Communicating Processes). The acronym ACP lm stands for ACP with abstraction, extended with operators and axioms for language matching. Language matching is a technique based on trace information for labelling and cutting oo process terms that do not match some given trace (or set of traces). It is shown tha...
The significant increase in using reservoir simulation models poses significant challenges in the design and calibration of models. Moreover, conventional model calibration, history matching, is usually performed using a trial and error process of adjusting model parameters until a satisfactory match is obtained. In addition, history matching is an inverse problem, and hence it may have non-uni...
In this note, we analyze two random greedy processes on sparse graphs and hypergraphs with a given degree sequence. First the matching process, which builds set of disjoint edges one edge at time; then independent an vertices vertex time. We use differential equations method apply general theorem Warnke. Our main contribution is to significantly reduce associated systems simplify expression for...
Annals of Social Sciences & Management studies are an international journal which focuses to spread a vast knowledge the readers. ASM includes various topics cover every part Sociology and management like Philosophy Public Affairs
Many schemaand ontology matching systems were developed to compute mapping suggestions for a user. Most of these systems are black boxes that often reimplement basic matching components which are extended by a few domain specific matchers. We observe that most systems mainly differ in their internal execution order and combination of matchers. In this paper, we advertise using a matching proces...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید