Algorithms for single link failure recovery and related problems.
Algorithms for weighted graph problems on the modified cellular graph automaton
Algoritmy a počítací stroje
Algoritmy a počítací stroje [Dokončení]
All Bézier curves are attractors of iterated function systems.
Almost curvature continuous fitting of B-spline surfaces.
Almost Optimal Set Covers in Finite VC-Dimension.
Almost Tight Bounds for e-Nets.
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
Alternative definitions of conditional possibilistic measures
The aim of this paper is to survey and discuss, very briefly, some ways how to introduce, within the framework of possibilistic measures, a notion analogous to that of conditional probability measure in probability theory. The adjective “analogous” in the last sentence is to mean that the conditional possibilistic measures should play the role of a mathematical tool to actualize one’s degrees of beliefs expressed by an a priori possibilistic measure, having obtained some further information concerning...
Amenable groups and cellular automata
We show that the theorems of Moore and Myhill hold for cellular automata whose universes are Cayley graphs of amenable finitely generated groups. This extends the analogous result of A. Machi and F. Mignosi “Garden of Eden configurations for cellular automata on Cayley graphs of groups” for groups of sub-exponential growth.
An worst case bounded special knapsack with two constraints
An abstract monadic semantics for value recursion
This paper proposes an operational semantics for value recursion in the context of monadic metalanguages. Our technique for combining value recursion with computational effects works uniformly for all monads. The operational nature of our approach is related to the implementation of recursion in Scheme and its monadic version proposed by Friedman and Sabry, but it defines a different semantics and does not rely on assignments. When contrasted to the axiomatic approach proposed by Erkök and Launchbury,...
An abstract monadic semantics for value recursion
This paper proposes an operational semantics for value recursion in the context of monadic metalanguages. Our technique for combining value recursion with computational effects works uniformly for all monads. The operational nature of our approach is related to the implementation of recursion in Scheme and its monadic version proposed by Friedman and Sabry, but it defines a different semantics and does not rely on assignments. When contrasted to the axiomatic approach proposed by Erkök and Launchbury,...
An adaptive approach for defending against DDoS attacks.
An additive Schwarz preconditioner for the spectral element ocean model formulation of the shallow water equations.
An agglomerative method for automatic forming of hierarchical classification
An algebraic approach to fix points of GOST-algorithm
An algebraic approach to Pólya processes
Pólya processes are natural generalizations of Pólya–Eggenberger urn models. This article presents a new approach of their asymptotic behaviour via moments, based on the spectral decomposition of a suitable finite difference transition operator on polynomial functions. Especially, it provides new results for large processes (a Pólya process is called small when 1 is a simple eigenvalue of its replacement matrix and when any other eigenvalue has a real part ≤1/2; otherwise, it is called large).
An algebraic treatment of flow diagrams and its application to generalized recursion theory