Honoriu VĂLEAN

19-24 NEGOCIERE ÎNTRE AGENŢI FOLOSIND PAXOS

Această intrare a fost publicată în 2011 Volumul 19 și etichetată Ancuţa DOBÎRCĂU Daniela BORDENCEA Elena BREAZ Honoriu VĂLEAN Ionuţ MUNTEAN la de

AGENT’S NEGOTIATION USING PAXOS
This paper describes an approach of agent negotiation using Paxos.
The Paxos algorithm is an elegant solution for the consensus problem and also,
a mechanism for the delivery of totally ordered messages that can be used to
support active replication. Consensus is an algorithm for agreement in the
presence of failures. However, the purpose is to ensure that a value that was
proposed is eventually chosen and, some process can eventually learn the
chosen value. Furthermore, the agent may use Paxos protocol in order to
negotiate on the same value.
Keywords: agent, consensus, Paxos
Cuvinte cheie: agent, consensus, PAXOS

24 NEGOCIERE ÎNTRE AGENŢI FOLOSIND PAXOS

19-27 DETERMINAREA DISTANŢEI MINIME ÎNTRE DOUĂ PUNCTE FOLOSIND ALGORITMI GENETICI

Această intrare a fost publicată în 2011 Volumul 19 și etichetată Ancuţa DOBÎRCĂU Daniela BORDENCEA Honoriu VĂLEAN la de

FINDING THE SHORTEST PATH BETWEEN TWO POINTS
USING GENETHIC ALGORITHMS
This paper describes some fundamentals of genetic algorithms. A
genetic algorithm (or GA for short) is a heuristic search technique used in
computing and Artificial Intelligence to find optimized solutions to search
problems using techniques inspired by evolutionary biology: mutation, selection,
reproduction [inheritance] and recombination.
Keywords: genetic algorithm
Cuvinte cheie: algoritm genetic

27 DETERMINAREA DISTANŢEI MINIME ÎNTRE DOUĂ