Horia Emil Popa

Learn More
—Distributed Constraint programming is a programming approach used to describe and solve large classes of problems such as searching, combinatorial and planning problems. A Distributed Constraint Satisfaction is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Modelling and simulation are essential(More)
The asynchronous searching techniques are characterized by the fact that each agent instantiates its variables in a concurrent way. Then, it sends the values of its variables to other agents directly connected to it by using messages. These asynchronous techniques have different behaviors in case of delays in sending messages. This article depicts the(More)
Additional communication links between unconnected agents are used in asynchronous searching, in order to detect obsolete information. A first way to remove obsolete information is to add new communication links, which allow a nogood owner to determine whether this nogood is obsolete or not. The second solution consists in temporarily keeping the links. A(More)
The use of agent-based simulation models in NetLogo for research is growing rapidly in a number of fields of science and engineering , including in computer science, for example for analyzing the performances of asynchronous search techniques based on distributed constraints. Distributed Constraint programming (DisCSP/DCOP) is a programming approach used to(More)