نتایج جستجو برای: generalized learning automata
تعداد نتایج: 779625 فیلتر نتایج به سال:
are presented in the context of their applications to complex genetic network dynamics, highly complex systems, quantum automata [2]–[3] and quantum supercomputers. Our novel approach to the Categorical Ontology Theory of Levels impacts on Medical Bioinformatics and self-organizing, Highly-Complex Systems (HCS), such as living organisms and artificial intelligent systems (AIs). Quantum Automata...
This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...
اتوماتای یادگیر سلولی، یک مدل ریاضی برای سیستم هایی است که از اجزاء ساده ای تشکیل شده اند و رفتار هر جزء بر اساس رفتار همسایگانش و نیز تجربیات گذشته اش تعیین و اصلاح می شود. اجزاء ساده تشکیل دهنده این مدل، از طریق تعامل با یکدیگر می توانند رفتار پیچیده ای از خود نشان دهند. هر اتوماتای یادگیر سلولی، از یک اتوماتای سلولی تشکیل شده است که هر سلول آن به یک یا چند اتوماتای یادگیر مجهز می باشد که وضع...
The relationships among various quantum automata are clarified, and in particular, variously equivalent characterizations of quantum automata are established. The G-quantum automata, g-quantum automata, (generalized) quantum automata, G-quantum grammars and g-quantum grammars are presented, and their connections to some of the other existing quantum automata are expounded. Under a certain condi...
Abstract AALpy is an extensible open-source Python library providing efficient implementations of active automata learning algorithms for deterministic, non-deterministic, and stochastic systems. We put a special focus on the conformance testing aspect in learning, as well intuitive seamlessly integrated interface characterizing real-world reactive In this article, we present ’s core functional...
In the past decade, active automata learning, an originally merely theoretical enterprise, got attention as a method for dealing with black-box or third party systems. Applications ranged from the support of formal verification, e.g. for assume guarantee reasoning [4], to usage of learned models as the basis for regression testing. In the meantime, a number of approaches exploiting active learn...
One of the basic restrictions in Ad Hoc Wireless Networks is energy supply and because of that proposing of power saving protocols that do the normal tasks of network without significantly diminishing the quality of services of the network and consequently, prolonging the lifetime of network has high importance. So, in this paper a distributed power saving technique for multi-hop ad hoc wireles...
In this paper, a new evolutionary computing model, called CLA-EC, is proposed. This model is a combination of a model called cellular learning automata (CLA) and the evolutionary model. In this model, every genome in the population is assigned to one cell of CLA and each cell in CLA is equipped with a set of learning automata. Actions selected by learning automata of a cell determine the genome...
We have trained networks of E II units with short-range connections to simulate simple cellular automata that exhibit complex or chaotic behaviour. Three levels of learning are possible (in decreasing order of difficulty): learning the underlying automaton rule, learning asymptotic dynamical behaviour, and learning to extrapolate the training history. The levels of learning achieved with and wi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید