Concept

Coût

Publications associées (371)

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.

Connectez-vous pour utiliser Chat avec Graph Search

Adaptive approaches for the improvement of public transport in Latin American Cities

Regina Witter

Apart from the best-practice cases where public administration has been able to manage the transit service network and implement a strong regulation system, in the majority of Latin American cities public urban transport is supplied by a great number of qu ...

Elsevier2007

A Recovery Algorithm for a Disrupted Airline Schedule

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

The airline scheduling is a very large and complex problem. Moreover, it is common that only a minority of the initial schedules are carried out as planned because of delays, airport closures or other unforeseen events. Thus, given an actual state of the r ...

2007

Towards a Scheduling Policy For Hybrid Methods on Computational Grids

Vincent Keller, Pierre Kuonen, Tuan Anh Nguyen

In this paper, we propose a cost model for running partic- ular component based applications on a computational Grid. This cost is evaluated by a metascheduler and negotiated with the user by a broker. A specific set of applications is considered: hybrid m ...

Springer Berlin / Heidelberg2006

Anypath routing

Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable wireless links, where the probability that at least one node out ofnreceives a packet increas ...

EPFL2006

Coupling climate and economic models in a cost-benefit framework: A convex optimisation approach

Alain Haurie

In this paper, we present a general method, based on a convex optimisation technique, that facilitates the coupling of climate and economic models in a cost-benefit framework. As a demonstration of the method, we couple an economic growth model à la Ramsey ...

2006

Some graph products and their expansion properties

Mohammad Amin Shokrollahi, Andrew Brown

We introduce "derandomized" versions of the tensor product and the zig-zag product, extending the ideas in the derandomized squaring operation of Rozenman and Vadhan. These enable us to obtain graphs with smaller degrees than those obtained using their non ...

2006

Systematic Design Flow for Dynamic Data Management in Visual Texture Decoder of MPEG-4

David Atienza Alonso, Miguel Peon Quiros

There is a clear trend of future embedded systems in moving toward wireless, multimedia, multi-functional and ubiquitous applications. This emerges new challenges in the existing solutions on performance, power, flexibility and costs, calling for innovatio ...

IEEE Circuits and Systems Society2006

Earthquake Induced Damage Estimation in Steel Buildings

Gustavo Cortes

This work presents a method for estimating the expected damage caused by an earthquake on steel buildings in Puerto Rico. Since Puerto Rico is located between a series of tectonic faults, buildings could suffer the damages caused by a major earthquake. The ...

2006

Design of heliostat fields using a multi-objective evolutionary algorithm

Daniel Favrat, Xavier Pelet

The paper discusses the interest of the multi-objective optimization approaches for the design of complex energy systems and the basics of the original evolutionary algorithm used. The specific problems linked to the design of the concentrators of solar to ...

2006

Fibonacci Heaps

Ali Chekir, Mohamed Slim Slama

Binomial heaps are data structures implemented as a collection of binomial trees, (A binomial tree of order K can be constructed from two trees of order (K-1)). They can implement several methods: Min, Insert, Union, ExtractMin, DecreaseKey and Delete. Fib ...

2006