Zeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego
نویسنده
چکیده
The study of multiagent distributed systems through the optics of the theory of formal grammars and languages is presented. Models based on NLC and BNLC graph grammars are mainly considered. The basic intuition of a grammar model of distributed systems follows the blackboard model for problem solving and is the following: component grammars forming the distributed system execute rewritings on a shared sentential form/graph. The order of participation on rewriting, the start and stop conditions of participation are determined by the strategies for the cooperation of components. The strategies of cooperation considered include the ones based on chains or linear, partial and arbitrary orders control relations. The introduced transformations on graphs representing the control permit one to obtain results regarding the synergy created by the cooperation.
منابع مشابه
Zeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego
Properties of actual and future languages for Multi-Agent System designing are outlined. This approach includes principles of Multi-Agent System programming: description of agent mental state, synchronous and asynchronous communication mechanisms, agent interpreter cycle, etc. An alternative approach is to adopt the used programming languages to design the Multi-Agent System. This approach is o...
متن کاملZeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego
Problem solving with multi-agent systems appears to be a very active research area nowadays. We present in this talk an overview of some works around distributed Constraint Satisfaction Problems and we point out some recent results about phase tarnsition and emergence in multi-agents resolution of such problems. We also point out the links and differences with distributed or randomized algorithms.
متن کاملZeszyty Naukowe Un Iwersytetu Jag Ie Llo Ń Sk Iego
Molecular computing is a new multidisciplinary area of research concerned with design, and theoretical and empirical understanding of computing gleaned from nature. It aims at the implementation of algorithms in molecular hardware, e.g. using DNA molecules and enzymes. The main advantages of the molecular computing lie in the possibility to obtain a massive parallelism of computation and associ...
متن کاملZeszyty Naukowe Politechniki Białostockiej. Informatyka an Algorithm for Generating Binary Pseudo-random Sequences
In the paper it is presented an algorithm for generating pseudo-random binary sequences. There are formulated theorems concerning properties of the sequence generated by the algorithm. The sequence is not periodic. Moreover, for any natural number n > 0, the initial fragment of the generated sequence of the length (2 · n) · 2(2·n) contains all (binary) series of the length n.
متن کاملZeszyty Naukowe Politechniki Białostockiej. Informatyka an Improved Approximation Algorithm for Optimal Routes Generation in Public Transport Network
This paper presents a new version of Routes Generation Matrix Algorithm, called Routes Generation Matrix Improved Algorithm (RGMIA), for determining routes with optimal travel time in public transport network. The method was implemented and tested on the real public transport network in Warsaw city. This network was completed with walk links and therefore resultant routes are more practical and...
متن کامل