RO EN
Communication Equivalence Classes in Networks
Authors: Gabriel Ciobanu, Mihai Gontineac
– 0.12 Mb
Abstract
The quotient structure defined by a specific equivalence relation allows to simplify the study of complex communications between processes in computer networks. The quotient also preserves the initial algebraic structure.Romanian Academy, Institute of Computer Science, Iasi,
E-mail: ,
E-mail:
E-mail: ,
E-mail:
Fulltext
– 0.12 Mb
Contents
- Communication Equivalence Classes in Networks
- An algorithm for solving a class of knapsack problems and its generalization
- On stability of an optimal situation in a finite cooperative game with a parametric concept of equilibrium (from lexicographic optimality to Nash equilibrium)
- On stability in game problems of finding Nash set
- The maximum flow in dynamic networks
- The multiobjective transportation fractional programming model
- A New Approach in Agent Path-Finding using State Mark Gradients
- A Case-Based Reasoning for Regulation of an Urban Transportation Network
- Experience of Macroeconomic Models Realization in Transition Economy
- About a family of C2 splines with one free generating function
- The comparative analysis of implementation practices of e-government services
- Electronic Services in Public Administration (e-government); Privacy and Freedom of Information. (review of study made for situation in Moldova)
