نتایج جستجو برای: integral constraint
تعداد نتایج: 191790 فیلتر نتایج به سال:
We investigate verification problems for gap-order constraint systems (GCS), an (infinitely-branching) abstract model of counter machines, in which constraints (over Z) between the variables of the source state and the target state of a transition are gap-order constraints (GC) [21]. GCS extend monotonicity constraint systems [3], integral relation automata [8], and constraint automata in [11]....
Abstract—This paper represents performance of particle swarm optimisation (PSO) algorithm based integral (I) controller and proportional-integral controller (PI) for interconnected hydro-thermal automatic generation control (AGC) with generation rate constraint (GRC) and Thyristor controlled phase shifter (TCPS) in series with tie line. The control strategy of TCPS provides active control of sy...
The variational autoregressive network is extended to the Euclidean path integral representation of quantum partition function. An essential challenge adapting sequential process sample generation by an a nonlocal constraint due periodic boundary condition in integral. add-on oracle devised for this purpose, which accurately identifies and stalls unviable configurations as soon they occur. enab...
throughout this dissertation r is a commutative ring with identity and m is a unitary r-module. in this dissertation we investigate submodules of multiplication , prufer and dedekind modules. we also stat the equivalent conditions for which is ring , wher l is a submodule of afaithful multiplication prufer module. we introduce the concept of integrally closed modules and show that faithful mu...
We present a brief description of the “consistent discretization” approach to classical and quantum general relativity. We exhibit a classical simple example to illustrate the approach and summarize current classical and quantum applications. We also discuss the implications for the construction of a well defined quantum theory and in particular how to construct a quantum continuum limit. 1.1 C...
The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
Robin Hirsch posed in 1996 the Really Big Complexity Problem: classify computational complexity of network satisfaction problem for all finite relation algebras A. We provide a complete classification case that A is symmetric and has fexible atom; this case, NP-complete or P. The task can be reduced to where integral. If integral algebra flexible atom, then it normal representation B. study usi...
Abstract The issue of the relationship between predictive processing (PP) and free energy principle (FEP) remains a subject debate controversy within research community. Many researchers have expressed doubts regarding actual integration PP with FEP, questioning whether FEP can truly contribute significantly to mechanistic understanding or even undermine such altogether. In this paper, I presen...
در این مقاله یک مدل غیر قطعی زنجیره تأمین حلقه بسته ، توسعه داده شده است. هدف اول این مدل، حداکثر سازی سود کل زنجیره می باشد. تابع هدف دوم، حداقل سازی استفاده از مواد خام است. به عبارت دیگر هدف دوم حداکثر کردن میزان بازیافت می باشد؛ که یکی از دلایل پیدایش سیستم های حلقه بسته نیز همین امر بود. بهینه سازی در مدل مذکور توسط الگوریتم ژنتیک صورت گرفته و توسط روش ε-constraint به یافتن خط بهینه پارتو ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید