• Aucun résultat trouvé

Solving the Flight Radius Problem

N/A
N/A
Protected

Academic year: 2021

Partager "Solving the Flight Radius Problem"

Copied!
9
0
0

Texte intégral

Loading

Figure

Figure 1: Model of condensed flight network in Neo4j.
Figure 2: Flight radius algorithm steps.
Table 3 gives the average running time as a function of classes of parameter K 1 and K 2
Table 2: Time needed to solve the flight radius problem with two criteria.

Références

Documents relatifs

In order to allow constraint solvers to handle GIPs in a global way so that they can solve them eciently without loosing CP's exibility, we have in- troduced in [1] a

Nous avons recherché des ouvrages et des revues sur le catalogue du réseau des bibliothèques de Suisse occidentale. Nous avons également demandé conseil au Docteur

In this paper we present a relation validation method for KBP slot filling task by exploring some graph features to classify the candidate slot fillers as correct or incorrect..

Odijk (1996) proposes the PCG (PESP Cut Generation) algorithm to generate timetables for train operations using a mathematical model consisting of periodic

As the cost function for the probe matching distance is always less than or equal to the cost to transform two probes into each other through an edit operation, the probe

In the context of graph databases, a Graph Database Model is a model where data structures for the schema and/or instances are modeled as graphs (or generalizations of them), the

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Despite these solutions are effective in producing a proper coloring, generally minimizing the number of colors, they produce highly skewed color classes, undesirable for