Efficient algorithms on the Moore family associated to an implicational system.
Efficient Binary Space Partitions for Hidden-Surface Removal and Solid Modeling.
Efficient calculation of sensitivities for optimization problems
Sensitivity information is required by numerous applications such as, for example, optimization algorithms, parameter estimations or real time control. Sensitivities can be computed with working accuracy using the forward mode of automatic differentiation (AD). ADOL-C is an AD-tool for programs written in C or C++. Originally, when applying ADOL-C, tapes for values, operations and locations are written during the function evaluation to generate an internal function representation....
Efficient drawing of RNA secondary structure.
Efficient Improvement of Brain-Tharp's Algorithm
Efficient maxima-finding algorithms for random planar samples.
Efficient validation and construction of border arrays and validation of string matching automata
We present an on-line linear time and space algorithm to check if an integer array is the border array of at least one string built on a bounded or unbounded size alphabet . First of all, we show a bijection between the border array of a string and the skeleton of the DFA recognizing , called a string matching automaton (SMA). Different strings can have the same border array but the originality of the presented method is that the correspondence between a border array and a skeleton of SMA...
Efficient validation and construction of border arrays and validation of string matching automata
We present an on-line linear time and space algorithm to check if an integer array f is the border array of at least one string w built on a bounded or unbounded size alphabet Σ. First of all, we show a bijection between the border array of a string w and the skeleton of the DFA recognizing Σ*ω, called a string matching automaton (SMA). Different strings can have the same border array but the originality of the presented method is that the correspondence between a border array and a...
Egipsys: An enhanced gene expression programming approach for symbolic regression problems
This paper reports a system based on the recently proposed evolutionary paradigm of gene expression programming (GEP). This enhanced system, called EGIPSYS, has features specially suited to deal with symbolic regression problems. Amongst the new features implemented in EGIPSYS are: new selection methods, chromosomes of variable length, a new approach to manipulating constants, new genetic operators and an adaptable fitness function. All the proposed improvements were tested separately, and proved...
Ein neuer Algorithmus zur Bestimmung einer basis von unabhängigen elementarkreisen in einem stark zusammenhängenden Graphen
Eine beweistheoretische Anwendung partieller stetiger Funktionale.
Empilements de cercles : convergence d'une méthode de point fixe
Empilements de cercles: Convergence d'une méthode de point fixe.
Ensembles infinis en programmation
Entiers intuitionnistes et entiers classiques en -calcul
Enumerating large orbits and direct condensation.
Envelope construction of two-parameteric system of curves in the technological practice
A two-parametric system of close planar curves is defined in the introduction of the presented article. Next a theorem stating the existence of the envelope is presented and proved. A mathematical model of the collecting mechanism of the Horal forage trailer is developed and used for practical demonstrations. The collecting mechanism is a double joint system composed of three rods. An equation describing the trajectory of a random point of the working rod is derived using Maple. The trajectories...
Équations linéaires dans les anneaux de polynômes
Equitable Probabilistic Elections in Ring Networks
Estimates for H2 functions with concentration at low degrees and applications to complex symbolic computation.