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 transition and emergence in multi-agents resolution of such problems. We also point out the links and differences with distributed or randomized algorithms.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.