Dynamic scheduling of a parallel server system in heavy traffic with complete resource pooling: asymptotic optimality of a threshold policy.
Dynamic systems and theory of simulation
Dynamic systems with the nonzero initial conditions excited by the Dirac function
Dynamic WWW structures in .
Dynamical directions in numeration
This survey aims at giving a consistent presentation of numeration from a dynamical viewpoint: we focus on numeration systems, their associated compactification, and dynamical systems that can be naturally defined on them. The exposition is unified by the fibred numeration system concept. Many examples are discussed. Various numerations on rational integers, real or complex numbers are presented with special attention paid to -numeration and its generalisations, abstract numeration systems and...
Dynamical models for computer viruses propagation.
Dynamics in binary neural networks with a finite number of patterns. I: General picture of the asynchronous zero temperature dynamics.
Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures
Soit U une fonction définie sur un ensemble fini E muni d'un noyau markovien irréductible M. L'objectif du papier est de comparer théoriquement deux procédures stochastiques de minimisation globale de U : le recuit simulé et un algorithme génétique. Pour ceci on se placera dans la situation idéalisée d'une infinité de particules disponibles et nous ferons une hypothèse commode d'existence de suffisamment de symétries du cadre (E,M,U). On verra notamment que contrairement au recuit simulé, toute...
Each regular code is included in a maximal regular code
EasyMSG : tools and techniques for an adaptive overlapping in SPMD programming
During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of computations and communications may be a way to reduce this drawback. We will see a implementation of this techniques...
EasyMSG: Tools and techniques for an adaptive overlapping in SPMD programming
During the development of a parallel solver for Maxwell equations by integral formulations and Fast Multipole Method (FMM), we needed to optimize a critical part including a lot of communications and computations. Generally, many parallel programs need to communicate, but choosing explicitly the way and the instant may decrease the efficiency of the overall program. So, the overlapping of computations and communications may be a way to reduce this drawback. We will see a implementation of this...
Échanges de trois d'intervalles et suites sturmiennes
On appelle échange d’intervalles l’application qui consiste à réordonner les intervalles d’une partition de suivant une permutation donnée. Dans le cas des partitions en trois intervalles, nous donnons une caractérisation combinatoire des suites codant, d’après la partition définissant l’échange, l’orbite d’un point de sous l’action de cette transformation.
ECO species.
Edge Insertion for Optimal Triangulations.
Edge-disjoint Hamiltonian cycles in two-dimensional torus.
Edge-orthogonal patches through a given rational Bézier curve.
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Effective constructions of grammars
Effective reduction of Goresky-Kottwitz-MacPherson graphs.
Efficiency of automata in semi-commutation verification techniques
Computing the image of a regular language by the transitive closure of a relation is a central question in regular model checking. In a recent paper Bouajjani et al. [IEEE Comput. Soc. (2001) 399–408] proved that the class of regular languages – called APC – of the form