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
Access structures for finding characteristic-dependent linear rank inequalities
Determining information ratios of access structures is an important problem in secret sharing. Information inequalities and linear rank inequalities play an important role for proving bounds on these ratios. Characteristic-dependent linear rank inequalities are rank inequalities which are true over vector spaces with specific field characteristic. In this paper, using ideas of secret sharing, we show a theorem that produces characteristic-dependent linear rank inequalities. These inequalities are...
Accurate and online-efficient evaluation of the a posteriori error bound in the reduced basis method
The reduced basis method is a model reduction technique yielding substantial savings of computational time when a solution to a parametrized equation has to be computed for many values of the parameter. Certification of the approximation is possible by means of an a posteriori error bound. Under appropriate assumptions, this error bound is computed with an algorithm of complexity independent of the size of the full problem. In practice, the evaluation of the error bound can become very sensitive...
Accurate computation of the relative entropy between stochastic regular grammars
ACS-TS: Train scheduling using ant colony system.
Acyclic, star and oriented colourings of graph subdivisions.
Adaptive bifurcation routing algorithms for computer-communication networks
Adaptive constraint reduction for training support vector machines.
Adaptive control of cluster-based Web systems using neuro-fuzzy models
A significant development of Web technologies requires the application of more and more complex systems and algorithms for maintaining high quality of Web services. Presently, not only simple decision-making tools but also complex adaptation algorithms using artificial intelligence techniques are applied for controlling HTTP request traffic. The paper presents a new LFNRD (Local Fuzzy-Neural Adaptive Request Distribution) algorithm for request distribution in cluster-based Web systems using neuro-fuzzy...
Adaptive control of system entropy
Adaptive filters for color image processing.
Adaptive search heuristics for the generalized assignment problem.
The Generalized Assignment Problem consists of assigning a set of tasks to a set of agents at minimum cost. Each agent has a limited amount of a single resource and each task must be assigned to one and only one agent, requiring a certain amount of the agent's resource. We present the application of a MAX-MIN Ant System (MMAS) and a greedy randomized adaptive search procedure (GRASP) to the generalized assignment problem based on hybrid approaches. The MMAS heuristic can be seen as an adaptive sampling...
Addition molle et fonctions p-locales.
Addressing the stochastic nature of scientific computations via dynamic loop scheduling.
Adhesive and quasiadhesive categories
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.