Arrow Research search

Author name cluster

Bruno Legeard

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
2 author rows

Possible papers

3

AAAI Conference 2021 Short Paper

Encoding Temporal and Spatial Vessel Context using Self-Supervised Learning Model (Student Abstract)

  • Pierre Bernabé
  • Helge Spieker
  • Bruno Legeard
  • Arnaud Gotlieb

Maritime surveillance is essential to avoid illegal activities and for environmental protection. However, the unlabeled, noisy, irregular time-series data and the large area to be covered make it challenging to detect illegal activities. Existing solutions focus only on trajectory reconstruction and probabilistic models that do ignore the context, such as the neighboring vessels. We propose a novel representation learning method that considers both temporal and spatial contexts learned in a self-supervised manner, using a selection of pretext tasks that do not require to be labeled manually. The underlying model encodes the representation of maritime vessel data compactly and effectively. This generic encoder can then be used as input for more complex tasks lacking labeled data.

LPAR Conference 1993 Conference Paper

Deciding in HFS-Theory via Linear Integer Programming

  • Mohamed Hibti
  • Henri Lombardi
  • Bruno Legeard

Abstract We give a reduction, in polynomialy bounded time, of the satisfiability problem in the set language MPLS, to an equivalent linear integer programming problem. We show that this provides an algorithm to decide the Set Unification Problem. The procedure performed gives the eventual unifiers of two set terms (i. e. at least a minimal exhaustive collection of unifiers) in “compact form”. The unifiers are given via the solutions of a linear integer system generated by the reduction. We also report further results concerning the construction of models over the atoms of the universe HFSA (the set model conceived here). These predict the number of useful atoms needed to produce a model of formulae involving the negation.

ICRA Conference 1992 Conference Paper

Hoist scheduling problem: an approach based on constraint logic programming

  • Pierre Baptiste
  • Bruno Legeard
  • Christophe Varnier

Scheduling the movements of a hoist in printed circuit board electroplating is known is the hoist scheduling problem (HSP). The objective of the HSP is to find an optimal cyclic sequence of moves for hoists. Results are already available for this problem, using classical operational research tools. They are briefly presented. Most of the proposed solutions are limited to the very specific initial model and are consequently difficult to apply in industrial problems. The constraint logic programming (CLP) approach to the problem is presented. A CLP model of the problem that allows modeling and solving more realistic cases is presented, and the results and the analysis of the solutions are outlined. >

v2026.09.13