Constructing Arrangements Optimally in Parallel.
Constructing canonical bases of quantized enveloping algebras.
Construction du treillis de Galois d'une relation binaire
Cet article constitue une présentation unifiée des principales méthodes de construction du treillis de Galois d'une correspondance. Nous rappelons d'abord sa définition, puis nous décrivons quatre algorithmes de construction des éléments du treillis qui sont les rectangles maximaux de la relation binaire. Ces algorithmes ne sont pas originaux. Les descriptions précises de algorithmes, le plus souvent absentes des publications originales, permettent une programmation simple, dans un langage procédural...
Construction of e-Nets.
Construction of solvable near-block designs with the aid of a computer. (Konstruktion auflösbarer Fast-Blockpläne mit Hilfe eines Computers.)
Contribution à la résolution numérique des équations de Laplace et de la chaleur
Convergence behavior of the (1 +, λ) evolution strategy on the ridge functions.
The convergence behavior of (1 +, λ)-ES is investigated at parabolic ridge, sharp ridge, and at the general case of the ridge functions. The progress rate, the distance to the ridge axis, the success rate, and the success probability are used in the analysis. The strong dependency of the (1 + λ)-ES to the initial conditions is shown using parabolic ridge test function when low distances to the ridge axis are chosen as the start value. The progress rate curve and the success probability curve of...
Convergence of the time-discretized monotonic schemes
Many numerical simulations in (bilinear) quantum control use the monotonically convergent Krotov algorithms (introduced by Tannor et al. [Time Dependent Quantum Molecular Dynamics (1992) 347–360]), Zhu and Rabitz [J. Chem. Phys. (1998) 385–391] or their unified form described in Maday and Turinici [J. Chem. Phys. (2003) 8191–8196]. In Maday et al. [Num. Math. (2006) 323–338], a time discretization which preserves the property of monotonicity has been presented. This paper introduces a proof of...
Coset enumeration of groups generated by symmetric sets of involutions.
Cost-efficient synthesis of multiprocessor heterogeneous systems
Counting equivalence classes of irreducible representations.
Covering a disk by disks.
Covering with rectangular pieces.
Cutwidth of the de Bruijn graph
Cyclic presentations of the trivial group.
Data types as algorithms
De l'utilisation de la notion de clique (sous-graphe complet symétrique) en matière de typologie de populations
Decomposition of a Symmetric Matrix (Handbook Series Linear Algebra).
Description of the Connected Components of a Semialgebraic Set in Single Exponential Time.
Deux constructions équivalentes d'un jeu d'arrangements pour les fichiers inverses multi-indices