Concept

Algorithme de parcours en largeur

Publications associées (38)

An Integrated Approach to Real-Time Mobile Robot Control in Partially Known Indoor Environments

In this paper we present a navigation method for mobile robots in partially known indoor environments based on integration of graph based search algorithms and dynamic window local obstacle avoidance method. With the attention on a dynamic environment thre ...

2005

Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm

Thomas Liebling, Jean-Albert Ferrez

We address the weighted max-cut problem, or equivalently the problem of maximizing a quadratic form in n binary variables. If the underlying (symmetric) matrix is positive semidefinite of fixed rank d, then the problem can be reduced to searching the extre ...

2004

Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

We propose FResher Encounter SearcH (FRESH), a simple algorithm for efficient route discovery in mobile ad hoc networks. Nodes keep a record of their most recent encounter times with all other nodes. Instead of searching for the destination, the source nod ...

2003

Age Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

2003

On parallel computation of blood flow in human arterial network based on 1-D modelling

Alfio Quarteroni, Luca Formaggia

Parallel computation of blood flow in a 1D model of human arterial network has been carried out employing a Taylor Galerkin finite element method. Message passing interface libraries have been used on Origin 2000 SGI machine. A Greedy strategy for load-dis ...

Springer-Verlag2003

Comment on ¨ A Deterministic Approach to the End-to-End Analysis of Packet Flows in Connection Oriented Networks¨

Jean-Yves Le Boudec

For original paper see Chlamtac et al. (IEEE/ACM Trans. Networking, vol.6, no.4, p.422-31, 1998 August). We prove that the buffer bound in the above paper, can be improved by using a modification of the proofs in the original paper together with so-called ...

2000

Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron

Thomas Liebling, François Margot

In this paper, we investigate the applicability of backtrack technique to solve the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtrack ...

1997

Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron

Thomas Liebling, François Margot

In this paper, we investigate the applicability of backtrack technique for solving the vertex enumeration problem and the face enumeration problem for a convex polyhedron given by a system of linear inequalities. We show that there is a linear-time backtra ...

1994

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