אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

Emergence can be defined as the way complex systems and patterns arise out of a multiplicity of relatively simple interactions. Emergent behavior based systems are believed to be scalable and robust due to their non-reliance on a critical central element or fragile hierarchy. In the talk, two novel distributed algorithms based on emergent behavior will be presented and their scalability and robustness will be discussed.