Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Social heuristics

Publications associées (27)

Competing islands limit the rate of adaptation in structured populations

Cornelia Pokalyuk

Beneficial mutations can co-occur when population structure slows down adaptation. Here, we consider the process of adaptation in asexual populations distributed over several locations ("islands"). New beneficial mutations arise at constant rate u(b), and ...

Elsevier2013

Discrete choice and microsimulation methods for agent-based land use modeling

Ricardo Daniel Hurtubia González

This thesis describes methods to model the land use component of an urban system. Specifi- cally, it proposes methods to model and simulate the location choice of agents (households or firms) and the formation of prices for real estate goods in a city. The ...

EPFL2012

Elicitation and Modeling of Operational Human Decision Making in a Supply Chain Context : a Study Based on Participatory Simulation

Souleïman Naciri

Supply chains (SC) are complex systems in which human beings play a key role. Whereas human impact is often taken into account in simulation models in terms of physical flows (material handling, fabrication), it is far less the case in terms of information ...

EPFL2010

Maximum independent sets of commuting and noninterfering inversions

Bernard Moret, Krister Swenson

Background: Given three signed permutations, an inversion median is a fourth permutation that minimizes the sum of the pairwise inversion distances between it and the three others. This problem is NP-hard as well as hard to approximate. Yet median-based ap ...

2009

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Nicolas Zufferey

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO- ...

2008

Network-Coded Broadcast: from Canonical Networks to Random Topologies

Christina Fragouli, Jörg Widmer

We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the ...

2008

Survivable Routing of Mesh Topologies in IP-over-WDM Networks by Recursive Graph Contraction

Patrick Thiran, Maciej Kurant

Failure restoration at the IP layer in IP-over-WDM networks requires to map the IP topology on the WDM topology in such a way that a failure at the WDM layer leaves the IP topology connected. Such a mapping is called survivable. Finding a survivable mappin ...

2007