Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions.
Dynamic gridmaps: comparing building techniques.
Mobile robots need to represent obstacles in their surroundings, even moving ones, to make right movement decisions. For higher autonomy the robot should automatically build such representation from its sensory input. This paper compares the dynamic character of several gridmap building techniques: probabilistic, fuzzy, theory of evidence and histogramic. Two criteria are defined to rank such dynamism in the representation: time to show a new obstacle and time to show a new hole. The update rules...
Dynamic overloading with copy semantics in object-oriented languages: a formal account
Mainstream object-oriented languages often fail to provide complete powerful features altogether, such as, multiple inheritance, dynamic overloading and copy semantics of inheritance. In this paper we present a core object-oriented imperative language that integrates all these features in a formal framework. We define a static type system and a translation of the language into the meta-language λ_object,, in order to account for semantic issues and prove type safety of our proposal.
Dynamic Point Location in Arrangements of Hyperplanes.
Dynamic programming as optimal path problem in weighted digraphs.
Dynamic programming for reduced NFAs for approximate string and sequence matching
searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance. Several methods were designed for the approximate string matching that simulate nondeterministic finite automata (NFA) constructed for this problem. This paper presents reduced NFAs for the approximate string matching usable in case, when we are interested only in occurrences having edit distance less than or equal to a given integer,...
Dynamic properties of cellular neural networks.
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.