Bounds for on-line selection
Bounds for orthogonal 3-D graph drawing.
Bounds for the degrees in the membership test for a polynomial ideal
Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences
Bounds of graph parameters for global constraints
This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph parameters used in the description of a global constraint. The article provides bounds for the most common used graph parameters.
Bounds of graph parameters for global constraints
This article presents a basic scheme for deriving systematically a filtering algorithm from the graph properties based representation of global constraints. This scheme is based on the bounds of the graph parameters used in the description of a global constraint. The article provides bounds for the most common used graph parameters.
Bounds on degrees of projective schemes.
Bounds on the Size of Tetrahedralizations.
Bounds on the throughput of an unslotted ALOHA channel in the case of a heterogeneous users' population
Bouquets of circles for lamination languages and complexities
Laminations are classic sets of disjoint and non-self-crossing curves on surfaces. Lamination languages are languages of two-way infinite words which code laminations by using associated labeled embedded graphs, and which are subshifts. Here, we characterize the possible exact affine factor complexities of these languages through bouquets of circles, i.e. graphs made of one vertex, as representative coding graphs. We also show how to build families of laminations together with corresponding lamination...
Brain-like functor control machine for general humanoid biodynamics.
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions
This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of instances...
Branching programs provide lower bounds on the area of VLSI circuits
Branching random walks on binary search trees: convergence of the occupation measure
We consider branching random walks with binary search trees as underlying trees. We show that the occupation measure of the branching random walk, up to some scaling factors, converges weakly to a deterministic measure. The limit depends on the stable law whose domain of attraction contains the law of the increments. The existence of such stable law is our fundamental hypothesis. As a consequence, using a one-to-one correspondence between binary trees and plane trees, we give a description of the...
Breaking the curse of dimensionality [Book]
Brève communication. Performance du gradient réduit généralisé avec une méthode quasi newtonienne pour la programmation non linéaire
Brève communication. Reconnaissance de sous-arborescences
Brèves communications. Application de la théorie des ramifications au problème de l’équivalence structurale de deux grammaires
Brèves communications. Formalisation d'un outil pour la description d'images