This paper presents a technique for the adaptive refinement of tetrahedral meshes. What makes it unique is that no neighbor information is required for the refined mesh to be co...
: Horizontal fragments of a class in an object-oriented database system contain subsets of the class extent or instance objects. These fragments are created with a set of system in...
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
Jean Berstel, Luc Boasson, Olivier Carton, Bruno P...
— This paper addresses the problem of simultaneous localization and mapping (SLAM) for teams of collaborating vehicles where the communication bandwidth is limited. We present a ...
Eric Nettleton, Sebastian Thrun, Hugh F. Durrant-W...