Concept

Collective intelligence

Related publications (183)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Les horizons de la gouvernance territoriale

Alors que les territoires fonctionnels de nos activités quotidiennes ne cessent de s’élargir, l’échelle d’intervention des pouvoirs publics reste encore souvent engoncée dans les territoires institutionnels. En dépit de multiples tentatives d’instaurer, so ...

Presses polytechniques et universitaires romandes2013

Architecture without Content 4: Necessary Architecture

Kersten Geers, Andrea Zanderigo

The Data Center is the most definitive and yet invisible typology of our contemporary world. It is the densest spot in our digital universe, a physically invisible space virtually visited by many. In a time when the collective spirit of the net itself is m ...

2013

Crowding of crowding leads to uncrowding

Michael Herzog, Bilge Sayim, Mauro Manassi

In crowding, target discrimination is impaired by flanking elements. What happens if a target is neighbored by flankers A and in addition by further flankers B? According to pooling models, crowding is the consequence of averaging features of target and fl ...

2013

Soft control of swarms: Analytical approach

Max-Olivier Hongler, Guillaume Adrien Sartoretti

We analytically study the collective dynamics of mutually interacting heterogeneous agents evolving in a random environment. Our formal framework consists of a collection of JV scalar drifted Brownian motions (BM) diffusing on R. The mutual interactions ar ...

2013

Evolving team compositions by agent swapping

Dario Floreano, Laurent Keller, Pawel Lichocki

Optimizing collective behavior in multiagent systems requires algorithms to find not only appropriate individual behaviors but also a suitable composition of agents within a team. Over the last two decades, evolutionary methods have been shown to be a prom ...

Institute of Electrical and Electronics Engineers2013

Using robots to understand social behavior

Dario Floreano, Laurent Keller, Sara Mitri

A major challenge in studying social behaviour stems from the need to disentangle the behaviour of each individual from the resulting collective. One way to overcome this problem is to construct a model of the behaviour of an individual, and observe whethe ...

Wiley-Blackwell2013

When the picture is complete, crowding disappears, and grouping rules

Michael Herzog, Gregory Francis, Mauro Manassi

In crowding, the perception of a target strongly deteriorates when flanked by neighboring elements. Crowding is often explained in terms of pooling, i.e., averaging target and flanker signals. The pooling hypothesis predicts stronger crowding when the numb ...

2012

Distributed Adaptation Decision-Taking Framework and Scalable Video Coding Tunneling for Edge and In-Network Media Adaptation

Daniele Renzi

Existing and future media ecosystems need to cope with the ever-increasing heterogeneity of networks, devices, and user characteristics collectively referred to as (usage) context. The key to address this problem is media adaptation to various and dynamica ...

IEEE2012

Ultrafast One- and Two-Dimensional UV Transient Absorption Spectroscopy of Haem Proteins

Cristina Consani

Proteins are dynamic macromolecules, which accomplish biological function driven by long-range interactions and global motions. While their biological function is often clear, little is known about the collective interactions which make these systems real ...

EPFL2012

Data Exchange Problem with Helpers

Michael Christoph Gastpar, Sameer Pawar

In this paper we construct a deterministic polyno- mial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the existence of another ...

2012