• Aucun résultat trouvé

Multiple query evaluation based on an enchanced genetic algorithm

N/A
N/A
Protected

Academic year: 2021

Partager "Multiple query evaluation based on an enchanced genetic algorithm"

Copied!
18
0
0

Texte intégral

Loading

Figure

Figure 1 : The genetic retrieval process
Table 2 : Variation of the precision values
Table  4  provides  a  summary  of  the  performance  of  our  proposed  approach  measured  by  the  improvement achieved compared to the single query evaluation method
Figure 2 : Effect of the virtual individual queries
+2

Références

Documents relatifs

This paper presents a method for ultrasonic characterization of porous silicon in which a genetic algorithm based optimization is used to solve the inverse problem. A one

The paper contributes to literature in designing a multiple objective linear model for integrated inventory-production-distribution planning which is close to real

One of the first contributions to solve the train scheduling or timetabling problems was made by Szpigel [20], he modelled the single track train scheduling problem as a job

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

• The first vector is a set of integers that represents the departure time of each train line at each station, e.g., if the instance of the problem have 3 lines and each line have

Given MRs, the operations over MRs and the notion of DR, relevance must, just as it does in utterance interpretation as a whole, intervene for the choice of which MRs

A space-filling curve (SFC) is an ordering function which creates a bijection between integers I and points X lying in a D-dimensional regular grid.. close points in the space

– Temporal consistency of the cropping window center, called c = (x, t) T : The previous constraint is necessary but not sufficient to draw a conclusion on the quality of the