Approximation of phenol concentration using novel hybrid computational intelligence methods
Approximation of proximities by aggregating T-indistinguishability operators.
Approximations diophantiennes des nombres sturmiens
Nous établissons pour tout nombre sturmien (de développement dyadique sturmien) des propriétés d'approximation diophantienne très précises, ne dépendant que de l'angle de la suite sturmienne, généralisant ainsi des travaux antérieurs de Ferenczi-Mauduit et Bullett-Sentenac.
Approximations of believability functions under incomplete identification of sets of compatible states
Approximations of lattice-valued possibilistic measures
Lattice-valued possibilistic measures, conceived and developed in more detail by G. De Cooman in 1997 [2], enabled to apply the main ideas on which the real-valued possibilistic measures are founded also to the situations often occurring in the real world around, when the degrees of possibility, ascribed to various events charged by uncertainty, are comparable only quantitatively by the relations like “greater than” or “not smaller than”, including the particular cases when such degrees are not...
Approximations of weighted independent set and hereditary subset problems.
Arbitrary weight changes in dynamic trees
Arbology: Trees and pushdown automata
We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata...
Arbres infinis et systèmes d'équations
ARCO pour la programmation arithmétique et combinatoire
Are linear algorithms always good for linear problems?
Areas of lattice polygons, applied to computer graphics
Arithmetic coding of weighted finite automata
Arithmetic properties of automata: regular sequences.
Arithmetics in numeration systems with negative quadratic base
We consider positional numeration system with negative base , as introduced by Ito and Sadahiro. In particular, we focus on arithmetical properties of such systems when is a quadratic Pisot number. We study a class of roots of polynomials , , and show that in this case the set of finite -expansions is closed under addition, although it is not closed under subtraction. A particular example is , the golden ratio. For such , we determine the exact bound on the number of fractional digits...
Arithmetische Prädikate über einem Bereich endlicher Automaten.
Arrangements of Segments that Share Endpoints: Single Face Results.
Arrow's Impossibility Theorem
A formalization of the first proof from [6].
Art of graph drawing and art.
Artificial intelligence methods in diagnostics of analog systems