de recherche BDD-Driven First-Order Satisfiability Procedures (Extended Version) (2008)
David Déharbe, Silvio Ranise, David Déharbe, Silvio Ranise, Thème Génie Logiciel, Projet Cassis
apport
Menelaos I. Karavelas, Mariette Yvinec, Thème Génie Logiciel, Projet Prisme, Unité Inria, Sophia Antipolis
apport
Jean-daniel Boissonnat, Menelaos I. Karavelas, Jean-daniel Boissonnat, Menelaos I. Karavelas, Thème Génie Logiciel, Projet Prisme
Voronoi cells and convex hulls of d-dimensional
Marc Daumas Cnrs, Marc Daumas Cnrs, Thème Génie Logiciel, Projet Arénaire
operations
de recherche Worst Cases for Correct Rounding of the Elementary Functions in Double Precision (2008)
Vincent Lefèvre, Jean-michel Muller, Vincent Lefèvre, Jean-michel Muller, Thème Génie Logiciel, Projet Arénaire
apport
de recherche Worst Cases and Lattice Reduction (2008)
Damien Stehlé, Vincent Lefèvre, Paul Zimmermann, Damien Stehlé, Vincent Lefèvre, Paul Zimmermann, ...
Abstract: We propose a new algorithm to find worst cases for correct rounding of an analytic function. We first reduce this problem to the real small value problem — i.e. for polynomials with real...
Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani, Laurent Vigneron, Yannick Chevalier, ...
apport de recherche
Emmanuel Coquery, François Fages, Emmanuel Coquery, François Fages, Thème Génie Logiciel, Projet Contraintes
apport de recherche Subtyping constraints in quasi-lattices
de recherche Faster Run-time Specialized Code using Data Specialization (2008)
Julia L. Lawall, Gilles Muller, Julia L. Lawall, Gilles Muller, Thème Génie Logiciel, Projet Compose
apport
de recherche Specialization Patterns (2008)
Ulrik Pagh Schultz, Julia L. Lawall, Charles Consel, Ulrik Pagh Schultz, Julia L. Lawall, Charles Consel, ...
apport
de recherche YASS: Similarity search in DNA sequences (2008)
Laurent Noé, Gregory Kucherov, Laurent Noé, Gregory Kucherov, Thème Génie Logiciel, Projet Adage
apport
de recherche Improved Incremental Randomized Delaunay Triangulation. (2007)
Olivier Devillers, Olivier Devillers, Thème Génie Logiciel, Projet Prisme
apport
Olivier Devillers, Olivier Devillers, Franco P. Preparata, Franco P. Preparata, Roberto Tamassia, Roberto Tamassia, ...
apport de recherche
Mireille Ducassé, Erwan Jahier, Erwan Jahier, Mireille Ducassé Y, Thème Génie Logiciel, Projet Lande
apport
de recherche Motion Planning of Legged Robots (2007)
Jean-daniel Boissonnat, Jean-daniel Boissonnat, Olivier Devillers, Olivier Devillers, Sylvain Lazard, Sylvain Lazard, ...
Abstract: We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body. The...
Hervé Brönnimann, Hervé Brönnimann, Olivier Devillers, Olivier Devillers, Thème Génie Logiciel, Projet Prisme, ...
The union of unit balls has quadratic complexity,
Alberto Ciaffaglione, Alberto Ciaffaglione, Luigi Liquori, Luigi Liquori, Marino Miculan, Marino Miculan, ...
apport de recherche
Alin Bostan, Alin Bostan, Bruno Salvy, Bruno Salvy, Éric Schost, Éric Schost, ...
apport
predicates on circle arcs (2007)
Apport De Recherche, Olivier Devillers Alex, Olivier Devillers, Ra Fronville, Bernard Mourrain, Monique Teillaud, ...
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparison of the abscissae...
Apport De Recherche, Sarah Mallet, Sarah Mallet, Mireille Ducassé, Mireille Ducassé, Thème Génie Logiciel, ...
Deductive databases manage large quantities of data and, in general, in a set-oriented way. The existing systems of explanation for deductive databases do not take these constraints into account. We...
Vues abstraites d'exécutions Prolog avec Opium (2007)
Apport De Recherche, Mireille Ducassé Irisa/insa, Mireille Ducassé Irisa/insa, Thème Génie Logiciel, Projet Lande
Views of Prolog Executions in Opium Mireille Ducasse, IRISA/INSA N 3531 Octobre 1998 TH EME 2 Abstract Views of Prolog Executions in Opium Mireille Ducass#, IRISA#INSA Th#me 2 # G#nie logiciel et...
de recherche Towards Veri able Device Drivers: An Approach based on Domain-Speci c Languages (2007)
Fabrice Mérillon, Fabrice Mérillon, Laurent Réveillère, Laurent Réveillère, Charles Consel, ...
Although peripheral devices come out at a frantic pace and require fast releases of drivers, little progress has been made to improve the development of drivers. Too often, this development consists...
de recherche Coca: A Debugger for C Based on Fine Grained Control Flow and Data Events (2007)
Apport De Recherche, Mireille Ducassé Irisa/insa, Mireille Ducassé Irisa/insa, Thème Génie Logiciel, Projet Lande
We present Coca, an automated debugger for C, where the breakpoint mechanism is based on events related to language constructs. Events have semantics whereas source lines used by most debuggers do...
de recherche A Modal Lambda Calculus with Iteration and Case Constructs (2007)
Apport De Recherche, Pierre Leleu, Pierre Leleu, Thème Génie Logiciel, Projet Croap
An extension of the simply-typed #-calculus allowing iteration and case reasoning over terms de#ned by means of higher order abstract syntax has recently been introduced by Jo#lle Despeyroux, Frank...
de recherche Experiments in Program Compilation by Interpreter Specialization (2007)
Apport De Recherche, Gilles Muller, Julia Lawall, Scott Thibault, Scott Thibault, Laurent Bercot, ...
Interpretation and run-time compilation techniques are becoming increasingly important due to the need to support heterogeneous architectures, evolving programming languages, and dynamically...
Apport De Recherche, Ranan Fraer, Ranan Fraer, Thème Génie Logiciel, Projet Croap
The typical program veri#cation system is a batch tool that accepts as input a program annotated with Floyd-Hoare assertions, performs syntactic and semantic analysis on it, and generates a list of...
Miloˇs D. Ercegovac, Miloš D. Ercegovac, Jean-michel Muller, Jean-michel Muller, Thème Génie Logiciel, ...
We adapt the radix-r digit-recurrence division algorithm to complex division. By prescaling the operands, we make the selection of quotient digits simple.
de recherche Optimal Line Bipartitions of Point Sets (2007)
Apport De Recherche, Olivier Devillers, Olivier Devillers, Matthew J. Katz, Matthew J. Katz, Thème Génie Logiciel, ...
Let S be a set of n points in the plane. We study the following problem: Partition S by a line into two subsets S a and S b such that maxff#S a #;f#S b #g is minimal, where f is any monotone function...
de recherche Computational Geometry and Discrete Computations (2007)
Olivier Devillers, Olivier Devillers, Thème Génie Logiciel, Projet Prisme
apport
Olivier Devillers, Olivier Devillers, Franco P. Preparata, Franco P. Preparata, Thème Génie Logiciel, Projet Prisme, ...
apport
de recherche Geometric Compression for Interactive Transmission (2007)
Olivier Devillers, Pierre-marie G, Thème Génie Logiciel, Projet Prisme
apport
Olivier Devillers, Olivier Devillers, Franco P. Preparata, Franco P. Preparata, Thème Génie Logiciel, Projet Prisme
apport de recherche Evaluating the cylindricity of a nominally cylindrical point set (draft)
de recherche Rounding Voronoi diagram (2007)
Olivier Devillers, Pierre-marie G, Thème Génie Logiciel, Projet Prisme
apport
Pierre Alliez, Pierre Alliez, David Cohen-steiner, David Cohen-steiner, Olivier Devillers, Olivier Devillers, ...
apport de recherche
Ioannis Z. Emiris, Ioannis Z. Emiris, Bernard Mourrain, Bernard Mourrain, Thème Génie Logiciel, Projet Safir
apport de recherche Polynomial system solving: the case of a six-atom molecule
Pierre Alliez, Pierre Alliez, Olivier Devillers, Olivier Devillers, Jack Snoeyink, Jack Snoeyink, ...
Removing degeneracies by perturbing the
Olivier Devillers, Olivier Devillers, Thème Génie Logiciel, Projet Prisme, Unité Inria, Sophia Antipolis
apport
Mark De Berg, Mark De Berg, Olivier Devillers, Olivier Devillers, Marc Van Kreveld, Marc Van Kreveld, ...
apport de recherche
Olivier Devillers, Olivier Devillers, Asish Mukhopadhyay, Asish Mukhopadhyay, Thème Génie Logiciel, Projet Prisme
apport de recherche Finding an ordinary conic and an ordinary hyperplane
An NP decision procedure for protocol insecurity with XOR (2003)
Yannick Chevalier, Yannick Chevalier, Ralf Küsters, Ralf Küsters, Michaël Rusinowitch, Michaël Rusinowitch, ...
apport de recherche
An NP decision procedure for protocol insecurity with XOR (2003)
Yannick Chevalier, Yannick Chevalier, Ralf Küsters, Ralf Küsters, Michaël Rusinowitch, Michaël Rusinowitch, ...
apport de recherche
Thème Génie Logiciel, Projet Algorithmes, Alin Bostan, Alin Bostan, Alin Bostan, Philippe Flajolet, ...
apport
New Low Cost and Undedicated Genetic Operators. (2002)
Blaise Madeline, Blaise Madeline, Thème Génie Logiciel, Projet Coprin
The mutation and cross-over operators are, with selection, the foundation of genetic algorithms. We show in this paper, some possibilities offered by these operators. Having explained the specificity...
Faster Triangle-Triangle Intersection Tests (2002)
Olivier Devilliers, Philippe Guigue, Olivier Devillers, Thème Génie Logiciel, Projets Prisme
This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching...
"Partially rounded" Small-Order Approximations for Accurate, . . . (2002)
Jean-michel Muller, Jean-michel Muller, Thème Génie Logiciel, Projet Arénaire
We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose order-1 coefficients are...
Finite Precision Elementary Geometric Constructions (2002)
Olivier Devillers, Philippe Guigue, Olivier Devillers, Thème Génie Logiciel, Projets Prisme
In this paper we propose a new approach for the robust computation of the nearest integer lattice points of some specific geometric constructions (intersection of two planar segments, circumcenter of...
Dynamical sources in information theory: A general analysis of trie structures (2001)
Julien Clément, Julien Clément, Brigitte Vallée, Brigitte Vallée, Thème Génie Logiciel, Projet Algo
de recherche
Splitting a Delaunay Triangulation in Linear Time (2001)
Bernard Chazelle, Bernard Chazelle, Olivier Devillers, Olivier Devillers, Ferran Hurtado, Ferran Hurtado, ...
Computing the Delaunay triangulation of n points requires usually a minimum of# n log n# operations, but in some special cases where some additional knowledge is provided, faster algorithms can be...
Walking in a Triangulation (2001)
Olivier Devillers, Sylvain Pion, Monique Teillaud, Thème Génie Logiciel, Projets Prisme, ...
Given a triangulation in the plane or a tetrahedralization in 3-space, weinvestigate the e#ciency of locating a pointbywalking in the structure with di#erent strategies. Key-words: Computational...
Analytic Combinatorics: Functional Equations (2001)
Robert Sedgewick, Robert Sedgewick, Thème Génie Logiciel, Projet Algo
apport de recherche
On The Number Of Cylindrical Shells (2001)
Olivier Devillers, Olivier Devillers, Thème Génie Logiciel, Projets Prisme, Unité Inria, Sophia Antipolis
Given a set P of n points in three dimensions, a cylindrical shell or zone cylinder is formed bytwo cylindrical cylinders with the same axis such that all points of P are between the two cylinders....
Object-Oriented Software Engineering Using Partial Evaluation (2000)
Ulrik Schultz, Ulrik Schultz, Thème Génie Logiciel
et calcul symbolique
A File System Based on Concept Analysis (2000)
Sebastien Ferre, Sébastien Ferré, Olivier Ridoux, Olivier Ridoux, Thème Génie Logiciel, Projet Lande
We present the design of a #le system whose organization is based on Concept Analysis ## la WilleGanter #. The aim is to combine querying and navigation facilities in one formalism. The #le system is...
Compilation of a Specialized Functional Language for Massively Parallel Computers (2000)
Pascal Fradet, Pascal Fradet, Julien Mallet, Julien Mallet, Thème Génie Logiciel, Projet Lande
: We propose a parallel specialized language that ensures portable and costpredictable implementations on parallel computers. The language is basically a #rst-order, recursion-less, strict functional...
Improving Goldschmidt Division, Square Root and Square Root Reciprocal (1999)
Laurent Imbert, David Matula, Jean-Michel Muller, Milos Ercegovac, Guoheng Wei, Milos Ercegovac, ...
: The aim of this paper is to accelerate division, square root and square root reciprocal computations, when Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last...
Some applications of Bezoutians in Effective Algebraic Geometry (1998)
Bernard Mourrain, Mohamed Elkadi, Mohamed Elkadi, Bernard Mourrain Y, Thème Génie Logiciel, Projet Saga, ...
In this report, we investigate some problems of effectivity, related to algebraic residue theory. We show how matrix techniques based on Bezoutian formulations, enable us to derive new algorithms for...
A complete analysis of Clarkson's algorithm for safe determinant evaluation (1996)
Hervé Brönnimann, Hervé Brönnimann, Mariette Yvinec, Mariette Yvinec, Thème Génie Logiciel, Projet Prisme, ...
In this paper, we give a complete and self-contained analysis of Clarkson's algorithm that performs safe and efficient determinant evaluation of an n × n matrix with integer...
A Probabilistic Analysis of the Power of Arithmetic Filters (1996)
Olivier Devillers, Olivier Devillers, Franco P. Preparata, Franco P. Preparata, Thème Génie Logiciel, Projet Prisme
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recentyears, since digital computers do not exhibit such...