for the Disjoint-Set Data Structure

ǫ -eient solutions of a multi-objetive optimization problem with stohasti searh algo- rithms.. F or this, we propose the set of interest, investigate its topology and state

To this aim, we use the generalized algorithm of type Chudnovsky with derivative evaluations on places of degree one, two and four applied on the descent over F 2 of

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

By using the conjecture of equality between the heavy and the inertial mass, it is possible to set the equality between the expansion of the mass produced by the self-induction to

The accidentals rate is determined separately for prompt γ-ray tagging and for delayed neu- tron tagging since the selection criteria (such as energy threshold, pulse arrival

Most studied sites are characterized by multiphase brittle deformation in which the observed brittle structures are the result of progressive saturation of the host rock by

In addition, the decrease in prediction accuracy is due to the fact that at some point, by increasing the number of iterations and the complexity of the model, the algorithm begins

The paper presents an algorithm for finding the maximum independent set in an undirected graph with absolute estimate of the accuracy.. Special notions are indroduced and