Previous Page 10

Displaying 181 – 193 of 193

Showing per page

Dynamic overloading with copy semantics in object-oriented languages: a formal account

Lorenzo Bettini, Sara Capecchi, Betti Venneri (2009)

RAIRO - Theoretical Informatics and Applications

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 programming for reduced NFAs for approximate string and sequence matching

Jan Holub (2002)

Kybernetika

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 WWW structures in 3 D .

Brandes, Ulrik, Kääb, Vanessa, Löh, Andres, Wagner, Dorothea, Willhalm, Thomas (2000)

Journal of Graph Algorithms and Applications

Dynamical directions in numeration

Guy Barat, Valérie Berthé, Pierre Liardet, Jörg Thuswaldner (2006)

Annales de l’institut Fourier

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...

Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures

Pierre Del Moral, Laurent Miclo (2006)

ESAIM: Probability and Statistics

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...

Currently displaying 181 – 193 of 193

Previous Page 10