Best papers are

2 Best papers :

Stefano Ciliberti "Message passing algorithms for non-linear nodes and data compression".

Stefano Nolfi " Behaviour as a complex adaptive system".

The Best Poster :

Anastasia Yartseva, Hanna Klaudel, François Képès "Incremental and unifying modeling formalism for biological interaction networks".

*******************

The Program Committee will split the Award (3000€) between the Best Paper, the Best Student Paper and the Best Poster, according to the following selection procedures :

Before the conference, the PC has selected a small set of candidate papers. On the last day of the conference and on the basis of both written papers and oral presentations, the PC will convene and select the Best Paper and the Best Student Paper. In case of papers with comparable merit, the PC may decide to award more than one prize in either or both categories. The criterion for a "student" paper is that the primary contributor defended his/her doctorate thesis no more than 3 years before the conference.

To select the Best Poster, each registered participant will receive one paper ballot during the conference. Participants will be encouraged to attend poster sessions to make up their mind. A voting booth will be open on the last day, where participants can cast their ballot by filling up the number of their favorite poster. At the end of the last conference day, the PC will select the best poster(s) based on the votes.

List Of Candidates

Best Paper Award

• Towards a functional formalism for modelling complex industrial systems
  D. Krob, S. Bliduze
• An electronically controlled microfluidics approach towards artificial cells
  Uwe Tangen,, Patrick F. Wagler, Steffen Chemnitz, Goran Goranovic,, Thomas Maeke, John S. McCaskill
• Message passing algorithms for non-linear nodes and data compression
  Stefano Ciliberti, Marc Mezard, Riccardo Zecchina
• Behaviour as a Complex Adaptive System
  Stefano Nolfi
• Ambiguity in Art
  Igor Yevin
• Weighted networks: empirical results and models
  Marc Barthélemy, Alain Barrat, Alessandro Vespignani
• Elements about the Emergence Issue A survey of emergence definitions
  Joris Deguet, Yves Demazeau, Laurent Magnin
• Invariant grids: method of complexity reduction in reaction networks
  A Gorban, I Karlin, A Zinovyev
• Sampling of networks with traceroute-like probes
  Alain Barrat, Ignacio Alvarez-Hamelin, Luca Dall'Asta, Alexei Vazquez, Alessandro Vespignani
• Towards an Economic Theory of Meaning and Language
  Gabor Fath, Miklos Sarvary
• The POEtic Electronic Tissue and its Role in the Emulation of Large-Scale Biologically Inspired Spiking Neural Networks Models
  Manuel J. Moreno, Yann Thoma, Eduardo Sanchez, Jan Eriksson, Javier Iglesias, Alessandro Villa
• Spreading on networks: a topographic view
  Geoffrey S Canright, Kenth Engø-Monsen

• A theory-based dynamical model of innovation processes
  David Lane, Roberto Serra,, Marco Villani, Luca Ansaloni
• Chemotaxis-Inspired Load Balancing
  Geoffrey Canright,, Andreas Deutsch,, Tore Urnes
• On the Dynamics of Communication and Cooperation in Artificial Societies
  A.E Eiben, M.C. Schut, N. Vink
• Design Patterns from Biology for Distributed Computing
  Ozalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni Di Caro, Frederick Ducatelle, Luca Gambardella, Niloy Ganguly, Mark Jelasity,, Roberto Montemanni, Alberto Montresor
• Optimization and control of the urban spatial dynamic
  Ferdinando Semboloni
• Emergent Group-Level Selection in a Peer-to-Peer Network
  David Hales
• Modeling Firm Skill-Set Dynamics as a Complex System
  Edoardo Mollona, David Hales
• Correlation Model of Worm Propagation on Scale-Free Networks
  Nikoloski Zoran, Deo Narsingh, Kucera Ludek
  Yaniv Altshuler, Arie Matsliah, Ariel Felner
• Production networks and failure avalanches
  Gérard Weisbuch, Stefano Battiston
• Understanding fractal analysis? The case of fractal linguistics
  H.F Jelinek, C Jones, M Warfel, C. Lucas, C. Depardieu, G Aurel

Student Best Paper Award

• Bounded Rationality and Repeated Network Formation (S)
  Sylvain Béal, Nicolas Quérou
• On the Complexity of Physical Problems and a Swarm Algorithm for k-Clique Search in Physical Graphs (S)
• Lightweight centrality measures in networks under attack (S)
  Giorgos Georgiadis, Lefteris Kirousis
• Measuring the Dynamical State of the Internet: Large Scale Network Tomography via the ETOMIC Infrastructure (S)
  Gabor Simon, Jozsef Steger, Peter Haga, Istvan Csabai,, Gabor Vattay
• Complex Qualitative Models in Biology: a new approach (S)
  P. Veber, M. Le Borgne, A. Siegel, S. Lagarrigue, O. Radulescu
• Shape spaces in formal interactions (S)
  Davide Prandi, Corrado Priami, Paola Quaglia
• Is selection optimal for scale-free small worlds? (S)
  Zs. Palotai,, Cs. Farkas, A. Lorincz
• Traffic dynamics in scale-free networks (S)
  Attila Fekete, Gabor Vattay, Ljupco Kocarev