Load balancing of multiphysics simulations by multi-criteria graph partitioning

Because of the need to serve transport connections of various levels of operating priority, an implementation shall support the withdrawal of flow control credit from any Class

For the supermarket model, it has been shown that using d = 2 choices yields an exponential improvement in the expected time a customer spends in the system over d = 1 choice

varieties up to isogeny (a free group generated by simple abelian varieties up to isogeny), is the subgroup generated by the Jacobians the whole group? It would actually suffice if

The number of school meals demanded during a week depends mainly on the price, the household monthly income, the number of additional children between 6 and 10 years old and between

Partition of square graph with fixed vertices using RB based algorithm (in 4 parts). A Multilevel k ­way Greedy Graph Growing Partitioning with Initial Fixed

Given Corollary 4, Theorem 2 follows from the next transcription in terms of the modular decomposition tree... We must prove that H is

We give in this paper an algorithm that enumerates the normal form of all the traces of solutions given a signed permutation, and counts the number of solutions in each trace,

A sharp affine isoperimetric inequality is established which gives a sharp lower bound for the volume of the polar body.. It is shown that equality occurs in the inequality if and