• Aucun résultat trouvé

Satisfaction-based Query Load Balancing

N/A
N/A
Protected

Academic year: 2021

Partager "Satisfaction-based Query Load Balancing"

Copied!
19
0
0

Texte intégral

Figure

Table 1. Providers set that are able to deal with the request.
Table 2. Simulation parameters.
Fig. 2. Uninteresting received queries.
Fig. 3. Response times.
+2

Références

Documents relatifs

The key elements of the CQA approach are the notion of repair of an inconsistent database D, that is, a consistent database whose difference with D is somehow minimal, and the notion

Practically, the proposed method, combining shifting query, pseudo relevance feedback, collective participating of the retrieved results (especially for QRM2

The framework is built on top of a Logic Programming approach to Knowledge Representation and Reasoning, complemented with a Case Based approach to computing.. The proposed

The main contributions of this paper are: (i) the introduction of the PrefDatalog+/– framework, the first (to our knowledge) combination of ontology languages with preferences as

In this paper we propose a new query expansion method that uses a struc- tured representation of documents and queries, named Weighted Word Pairs, that is capable of reducing the

An ad- ditional limitation of D I V A is that the value function V is learned from a set of trajectories obtained from a ”naive” controller, which does not necessarily reflect

Mapping SPARQL Query to temporal logic query based on NµSMV Model Checker to Query Semantic Graphs.. Mahdi Gueffaz, Sylvain Rampacek,

After this transformation, NµSMV verifies the correctness of the model written in NµSMV language with temporal logic in order to verify the consistency of the