Skip to content

Alexandre Goldsztejn

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

19

Venues

6

Active years

2006–2020

Best venue rank

A*

Where they publish

Papers

19 indexed papers, newest first.

YearVenueTitleAuthors
2020CPTowards a Generic Interval Solver for Differential-Algebraic CSP.Simon Rohou, Abderahmane Bedouhene, Gilles Chabert, Alexandre Goldsztejn, Luc Jaulin, Bertrand Neveu, Victor Reyes, Gilles Trombettoni
2020ICRAR-Min: a Fast Collaborative Underactuated Parallel Robot for Pick-and-Place Operations.Guillaume Jeanneau, Vincent Bgoc, Sbastien Briot, Alexandre Goldsztejn
2017ICRACertified detection of parallel robot assembly mode under Type 2 singularity crossing trajectories.Adrien Koessler, Alexandre Goldsztejn, Sbastien Briot, Nicolas Bouton
2017RVHySIA: Tool for Simulating and Monitoring Hybrid Automata Based on Interval Analysis.Daisuke Ishii, Alexandre Goldsztejn
2014CPThe Non-overlapping Constraint between Objects Described by Non-linear Inequalities.Ignacio Salas, Gilles Chabert, Alexandre Goldsztejn
2013CPConstraint Based Computation of Periodic Orbits of Chaotic Dynamical Systems.Alexandre Goldsztejn, Laurent Granvilliers, Christophe Jermann
2012CPA Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots.Stphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii, Christophe Jermann
2011CPSymmetry Breaking in Numeric Constraint Problems.Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras
2010CPIncluding Ordinary Differential Equations Based Constraints in the Standard CP Framework.Alexandre Goldsztejn, Olivier Mullier, Damien Eveillard, Hiroshi Hosobe
2010SACBox consistency through adaptive shaving.Alexandre Goldsztejn, Frdric Goualard
2009IJCAISearch Strategies for an Anytime Usage of the Branch and Prune Algorithm.Raphal Chenouard, Alexandre Goldsztejn, Christophe Jermann
2008CPA New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions.Alexandre Goldsztejn, Laurent Granvilliers
2008CPRevisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm.Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher
2008CPA Branch and Bound Algorithm for Numerical MAX-CSP.Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frdric Benhamou
2008PDCATA Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations.Frdric Goualard, Alexandre Goldsztejn
2008SACAn efficient algorithm for a sharp approximation of universally quantified inequalities.Alexandre Goldsztejn, Claude Michel, Michel Rueher
2006CPInner and Outer Approximations of Existentially Quantified Equality Constraints.Alexandre Goldsztejn, Luc Jaulin
2006SACA branch and prune algorithm for the approximation of non-linear AE-solution sets.Alexandre Goldsztejn
2006SACInner approximation of distance constraints with existential quantification of parameters.Carlos Grandn, Alexandre Goldsztejn