Publications associées (49)

Optimizing Variable Ordering of BDDs with Double Hybridized Embryonic Genetic Algorithm.

This paper presents a new double hybridized genetic algorithm for optimizing the variable order in Reduced Ordered Binary Decision Diagrams. The first hybridization adopts embryonic chromosomes as prefixes of variable orders instead of complete variable or ...
2010

Dynamic Testing of Flow Graph Based Parallel Applications

Roger Hersch

In message-passing parallel applications, messages are not delivered in a strict order. The number of messages, their content and their destination may depend on the ordering of their delivery. Nevertheless, for most applications, the computation results s ...
ACM2008

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Murtuza Jadliwala

Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundamental theoretical questions still remain unanswered: in the presence of malicious b ...
IEEE Computer Society2008

Gene Expression Data Analysis Using a Novel Approach to Biclustering Combining Discrete and Continuous Data

Lei Zhang, Yann Christinat

Many different methods exist for pattern detection in gene expression data. In contrast to classical methods, biclustering has the ability to cluster a group of genes together with a group of conditions (replicates, set of patients, or drug compounds). How ...
2008

Approach for Dynamic Origin-Destination Matrices Estimation in Urban Context

André-Gilles Dumont, Edward Chung, Emmanuel Bert

The aim of this paper is to explore a new approach to obtain better traffic demand (Origin-Destination, OD matrices) in dense urban networks. From reviewing actual methods, for static and dynamic OD matrix evaluation, possible deficiencies in the approach ...
2008

Urban Dynamic Origin-Destination Matrices Estimation

André-Gilles Dumont, Edward Chung, Emmanuel Bert

The aim of this paper is to explore a new approach to obtain better traffic demand (Origin-Destination, OD matrices) for dense urban networks. From reviewing existing methods, from static to dynamic OD matrix evaluation, possible deficiencies in the approa ...
2008

A heuristic for global nonlinear optimization

Michel Bierlaire, Michaël Clément Louis Ghislain Thémans, Nicolas Zufferey

The proposed heuristic combines a variable neighborhood search (VNS) framework with a local search performed by a trust-region algorithm. The curvature of the function is exploited to generate the neighborhoods. Numerical results illustrate an excellent be ...
2007

Discrete choice models and heuristics for global nonlinear optimization

Michel Bierlaire

The lecture will consist in two parts. First, recent advances in discrete choice models will be presented and motivated. The estimation of these advanced models involves the maximization of a nonlinear, nonconcave loglikelihood function. The nonconcavity o ...
2007

Dynamic Origin-Destination Matrices Estimation Method for urban Networks

André-Gilles Dumont, Edward Chung, Emmanuel Bert

The aim of this paper is to explore a new approach to obtain better traffic demand (Origin-Destination, OD matrices) in case of dense urban networks. To improve the global process of OD demand estimation, this paper is focussing on a new methodology to exe ...
2007

From material flow analysis to material flow management Part II: the role of structural agent analysis

Claudia Rebeca Binder Signer

This paper presents a heuristic for supporting the transition from material flow analysis to material flow management. The heuristic combines material flow analysis with a newly developed method, structural agent analysis (SAA). The latter is based on Gidd ...
2007

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.