Concept

Windows Vista

Related publications (77)

Frequency analysis with coupled nonlinear oscillators

Auke Ijspeert, Jonas Buchli, Ludovic Righetti

We present a method to obtain the frequency spectrum of a signal with a nonlinear dynamical system. The dynamical system is composed of a pool of adaptive frequency oscillators with negative mean-field coupling. For the frequency analysis, the synchronizat ...

2008

New dynamic programming algorithms for the resource constrained shortest path problem.

Matteo Salani

The resource constrained elementary shortest path problem (RCESPP) arises as a pricing subproblem in branch-and-price algorithms for vehicle-routing problems with additional constraints. We address the optimization of the RCESPP and we present and compare ...

2008

Column generation for a real world vehicle routing problem

Matteo Salani

We present an optimization algorithm we developed for a software provider of planning tools for distribution logistics companies. The algorithm computes a daily plan for a heterogeneous fleet of vehicles, that can depart from different depots and must visi ...

2007

Trust-inspiring explanation interfaces for recommender systems

Pearl Pu Faltings, Li Chen

A recommender system's ability to establish trust with users and convince them of its recommendations, such as which camera or PC to purchase, is a crucial design factor especially for e-commerce environments. This observation led us to build a trust model ...

Elsevier, Amsterdam, 1000 AE, Netherlands2007

A window-based automatic hardware/software partitioning heuristic

Hadi Parandeh Afshar

System-level design decisions such as HW/SW partitioning, target architecture selection and scheduler selection are some of the main concerns of current complex system-on-chip (SOC) designs. In this paper, a novel window-based heuristic is proposed that ad ...

2007

A pricing algorithm for the vehicle routing problem with soft time windows

Matteo Salani

The Vehicle Routing Problem with Soft Time Windows consists in computing a minimum cost set of routes for a fleet of vehicles of limited capacity that must visit a given set of customers with known demand, with the additional feature that each customer exp ...

2006

Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

Matteo Salani

When vehicle routing problems with additional constraints, such as capacity or time windows, are solved via column generation and branch-and-price, it is common that the pricing subproblem requires the computation of a minimum cost constrained path on a gr ...

2006

Branch-and-Price Algorithms for Vehicle Routing Problems

Matteo Salani

In this thesis we consider some routing problems and exact algorithms to solve them based on the branch-and-price framework. We consider three variants of the Vehicle Routing Problem (VRP): the Capacitated Vehicle Routing Problem (CVRP): is the basic and m ...

Università degli studi di Milano2006

METHOD AND RECEIVER DEVICE FOR WIRELESS DATA COMMUNICATION THROUGH TEMPORALLY CODED ULTRA WIDEBAND SIGNALS

Pierre-André Farine, Cyril Botteron

The invention concerns a wireless data communication method, wherein a transmitter device (2) having a first broadband antenna (27) transmits ultra wideband coded data signals to a receiver device (3) having a second broadband antenna (37) for receiving th ...

2005

Design of a time-efficient video-goniophotometer combining bidirectional functions assessment for transmission and reflection

Marilyne Andersen, Jean-Louis Scartezzini, Christian Roecker

A detailed knowledge of the light distribution characteristics through advanced window systems is required to improve the visual comfort of the building's occupants while controlling the propagation of daylight in rooms and the solar gains. An innovative b ...

Elsevier2005

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.