#### Filter Results:

- Full text PDF available (28)

#### Publication Year

1986

2018

- This year (0)
- Last 5 years (7)
- Last 10 years (50)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec
- Discrete & Computational Geometry
- 1992

This paper presents a general framework for the design and randomized analysis of geometric algorithms. These algorithms are on-line and the framework provides general bounds for their expected space… (More)

- Laurent Alonso, Edward M. Reingold, René Schott
- SIAM J. Comput.
- 1997

Given a set of $n$ elements each of which is either red or blue, it is known that in the worst case $n-\nu(n)$ pairwise equal/not equal color comparisons are necessary and sufficient to determine the… (More)

- Miguel Alabau, Lhassane Idoumghar, René Schott
- TBC
- 2002

This paper presents a new hybrid genetic algorithm used to solve a frequency assignment problem. The hybrid genetic algorithm presented uses two original mutation and two crossover operators. Theses… (More)

- Eric Monfroy, Michaël Rusinowitch, René Schott
- SAC
- 1996

We investigate the use of cooperation between solvers in the scheme of constraint logic programming languages over the domain of non-linear polynomial constraints. Instead of using a general and… (More)

- Ricardo A. Baeza-Yates, René Schott
- Comput. Geom.
- 1995

Abstract In this paper we investigate parallel searching in the plane using robots as searchers. We show that a huge number of robots are not necessary for several problems and under different… (More)

- Philippe Flajolet, René Schott
- Eur. J. Comb.
- 1990

The counting sequence of a special class of set partitions leads to special numbers called Bessel numbers. The corresponding ordinary generating function has a simple continued fraction expansion… (More)

- Lhassane Idoumghar, Mahmoud Melkemi, René Schott, Maha Idrissi-Aouad
- Applied Comp. Int. Soft Computing
- 2011

The paper presents a novel hybrid evolutionary algorithm that combines Particle Swarm Optimization (PSO) and Simulated Annealing (SA) algorithms. When a local optimal solution is reached with PSO,… (More)

Combinatorial Algebras and Their Properties Combinatorics and Graph Theory Operator Calculus Probability on Algebraic Structures Computational Complexity Symbolic Computations Using Mathematica.

- Laurent Alonso, Edward M. Reingold, René Schott
- SIAM J. Discrete Math.
- 1995

Bounds are obtained for the solution to the divide-and-conquer recurrence \[M(n) = \max_{k_1 + \cdots + k_p = n} (M(k_1) + M(k_2) +\cdots + M(k_p) + \min (f(k_1), \cdots, f(k_p))),\] for… (More)

- Laurent Alonso, René Schott
- MFCS
- 1993

We consider the following problem: Given ordered labeled trees S and T can S be obtained from T by deleting nodes ? Deletion of the root node u of a subtree with children (T1,..., Tn) means replacing… (More)