Abgeschwächte Observabilitätsbegriffe für stochastische Automaten
About the choice of the variable to unassign in a decision repair algorithm
The decision repair algorithm (Jussien and Lhomme, Artificial Intelligence 139 (2002) 21–45), which has been designed to solve constraint satisfaction problems (CSP), can be seen, either (i) as an extension of the classical depth first tree search algorithm with the introduction of a free choice of the variable to which to backtrack in case of inconsistency, or (ii) as a local search algorithm in the space of the partial consistent variable assignments. or (iii) as a hybridisation between local...
About the choice of the variable to unassign in a decision repair algorithm
The decision repair algorithm (Jussien and Lhomme, Artificial Intelligence139 (2002) 21–45), which has been designed to solve constraint satisfaction problems (CSP), can be seen, either (i) as an extension of the classical depth first tree search algorithm with the introduction of a free choice of the variable to which to backtrack in case of inconsistency, or (ii) as a local search algorithm in the space of the partial consistent variable assignments. or (iii) as a hybridisation between local...
About the computation of the signature of surface singularities z N + g(x, y) = 0
In this article we describe our experiences with a parallel Singular implementation of the signature of a surface singularity defined by z N + g(x; y) = 0.
About the decision of reachability for register machines
We study the decidability of the following problem: given affine functions over and two vectors , is reachable from by successive iterations of (in this given order)? We show that this question is decidable for and undecidable for some fixed .
About the decision of reachability for register machines
We study the decidability of the following problem: given p affine functions ƒ1,...,ƒp over and two vectors , is v2 reachable from v1 by successive iterations of ƒ1,...,ƒp (in this given order)? We show that this question is decidable for p = 1, 2 and undecidable for some fixed p.
About the domino problem in the hyperbolic plane from an algorithmic point of view
This paper is a contribution to the general tiling problem for the hyperbolic plane. It is an intermediary result between the result obtained by R. Robinson [Invent. Math.44 (1978) 259–264] and the conjecture that the problem is undecidable.
About the geometry of milling paths.
About the globular homology of higher dimensional automata
About the maximum information and maximum likelihood principles
Neural networks with radial basis functions are considered, and the Shannon information in their output concerning input. The role of information- preserving input transformations is discussed when the network is specified by the maximum information principle and by the maximum likelihood principle. A transformation is found which simplifies the input structure in the sense that it minimizes the entropy in the class of all information-preserving transformations. Such transformation need not be unique...
About the use of neural networks in integrated numerical circuits and systems.
Abstract action potential models for toxin recognition.
Abstract numeration systems on bounded languages and multiplication by a constant.
Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
Accelerated series for universal constants, by the WZ method.
Accelerating backtrack search with a best-first-search strategy
Acceleration of Le Bail fitting method on parallel platforms
Le Bail fitting method is procedure used in the applied crystallography mainly during the crystal structure determination. As in many other applications, there is a need for a great performance and short execution time. In this paper, we describe utilization of parallel computing for mathematical operations used in Le Bail fitting. We present an algorithm implementing this method with highlighted possible approaches to its aforementioned parallelization. Then, we propose a sample parallel version...
Acceptors and generalized -grammars
Accès non uniformément répartis dans une base de données : approche probabiliste et modélisation
Accès non uniformément répartis dans une base de données : généralisation d'une approche probabiliste