A μ-tree organizes the database in recursively partitioned Voronoi regions and represents these partitions as a tree.
In spite of these partitions, the Frankish kings continued their conquests.
These partitions are usually moveable, allowing the interior to be rearranged.
Is not one of these partitions privileged by the grounding relation?
However, in practical situations, these partitions are not all distinct and if we compute the stochastic bisimulation using all these partitions, the process can be very slow.
These partitions of the network can be seen in Fig. 10 as shown below.
These partitions fall into two categories: prediction (training) landslides and validation (testing) landslides.
An hypervisor provides these partitions or virtual machines, ensuring spatial, temporal and fault isolation between them.
The difference is given by the fact that these partitions have no part equal to 1.
These partitions are denoted by A 1 FDF, A 2 FDF and A 3 FDF, respectively.
For all these partitions, ME is carried out and a separate MV is generated.
