Fairness and control
Fairness and regularity for SCCS processes
Fairness for synchronous fork-join nets
Familles de langages
Far from equilibrium computation and particle swarm optimization.
Fast algorithms for finding a subdirect decomposition and interesting congruences of finite algebras
Fast approximation of centrality.
Fast approximation of minimum multicast congestion – Implementation versus theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known -hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with edges and multicast requests, an -approximation can be computed in time, where bounds the time for computing an -approximate minimum Steiner tree. Moreover, we present a new fast heuristic that...
Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
The problem of minimizing the maximum edge congestion in a multicast communication network generalizes the well-known NP-hard multicommodity flow problem. We give the presently best theoretical approximation results as well as efficient implementations. In particular we show that for a network with m edges and k multicast requests, an r(1 + ε)(rOPT + exp(1)lnm)-approximation can be computed in O(kmε-2lnklnm) time, where β bounds the time for computing an r-approximate minimum Steiner tree. Moreover,...
Fast diagnosis of multiprocessor systems with random faults
Fast diagnosis of some semigroup properties of automata
Fast multiplication of small numbers.
Fast searching for Andrews-Curtis trivializations.
Faster backtracking algorithms for the generation of symmetry-invariant permutations.
Fault injection stress strategies in dependability analysis
Featureless pattern classification
In this paper the possibilities are discussed for training statistical pattern recognizers based on a distance representation of the objects instead of a feature representation. Distances or similarities are used between the unknown objects to be classified with a selected subset of the training objects (the support objects). These distances are combined into linear or nonlinear classifiers. In this approach the feature definition problem is replaced by finding good similarity measures. The proposal...
Feedback, trace and fixed-point semantics
We introduce a notion of category with feedback-with-delay, closely related to the notion of traced monoidal category, and show that the Circ construction of [15] is the free category with feedback on a symmetric monoidal category. Combining with the Int construction of Joyal et al. [12] we obtain a description of the free compact closed category on a symmetric monoidal category. We thus obtain a categorical analogue of the classical localization of a ring with respect to a multiplicative subset....
Feedback, trace and fixed-point semantics
We introduce a notion of category with feedback-with-delay, closely related to the notion of traced monoidal category, and show that the Circ construction of [15] is the free category with feedback on a symmetric monoidal category. Combining with the Int construction of Joyal et al. [12] we obtain a description of the free compact closed category on a symmetric monoidal category. We thus obtain a categorical analogue of the classical localization of a ring with respect to a multiplicative subset....
Fehleranalyse für die Gauß-Elimination zur Berechnung der Lösung minimaler Länge.
Fermeture de certaines classes de langages formels sous des permutations linguistiques