Publication

Parallelization of population-based evolutionary algorithms for combinatorial optimization problems

Related publications (173)

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.

Can a Helmholtz solver run on a cluster?

Marc Anthony David Habisreutinger, Emmanuel Leriche, Vincent Keller

Our vectorized Helmholtz solver runs at 85% efficiency on a NEC SX-5. The most time-consuming parts have been ported on SMP, NUMA, and cluster architectures. It is shown that an OpenMP version can deliver similar performance when running it on a 16 process ...

IEEE2006

Fast Probabilistic Subsumption Checking for Publish/Subscribe Systems

Karl Aberer, Ivana Podnar, Oana Anca Jurca

Efficient subsumption checking, deciding whether a subscription or publication is subsumed (covered) by a set of previously defined subscriptions, is of paramount importance for publish/subscribe systems. It provides the core system functionality, and addi ...

2006

Wireless operators in a shared spectrum

Jean-Pierre Hubaux, Mark Felegyhazi

So far, cellular networks have been operated in "private" frequency bands. But recently, several researchers and legislators have argued in favor of a more flexible and more efficient management of the spectrum, leading to the possible coexistence of sever ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2006

Wireless Operators in a Shared Spectrum

Jean-Pierre Hubaux, Mark Felegyhazi

2006

A simulator for parallel applications with dynamically varying compute node allocation

Roger Hersch, Sebastian Gerlach

Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. We introduce the concept of dynamic efficiency which expresses the resource utilization efficiency as a function of ...

2006

A Propagation/Local Search Hybrid for Distributed Optimization

Boi Faltings, Adrian Petcu

We present a new hybrid algorithm for local search in distributed combinatorial optimization. This method is a mix between classical local search methods in which nodes take decisions based only on local information, and full inference methods that guarant ...

2005

Fault-tolerant parallel applications with dynamic parallel schedules

Roger Hersch, Sebastian Gerlach

Commodity computer clusters are often composed of hundreds of computing nodes. These generally off-the-shelf systems are not designed for high reliability. Node failures therefore drive the MTBF of such clusters to unacceptable levels. The software framewo ...

Institute of Electrical and Electronics Engineers Computer Society, Piscataway, NJ 08855-1331, United States2005

What can we learn by transposing the calibration – validation paradigm into a multi-objective context ?

André Musy, Bettina Schaefli

The classical single-objective model calibration and validation approach using different time periods for each of them is known not to be sufficient to judge whether the model predictions are consistent or to detect model structural deficiencies. It is how ...

2005

Wireless Operators in a Shared Spectrum

Jean-Pierre Hubaux, Mark Felegyhazi

2005

Wireless Operators in a Shared Spectrum

Jean-Pierre Hubaux, Mark Felegyhazi

So far, cellular networks have been operated in ``private" frequency bands. But recently, several researchers and legislators have argued in favor of a more flexible and more efficient management of the spectrum, leading to the possible coexistence of seve ...

2005