| 2011 | ||
|---|---|---|
| 27 | Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz de Angulo, Carme Torras: Symmetry Breaking in Numeric Constraint Problems. CP 2011: 317-324 | |
| 26 | Alexandre Goldsztejn, Wayne Hayes, Pieter Collins: Tinkerbell Is Chaotic. SIAM J. Applied Dynamical Systems 10(4): 1480-1501 (2011) | |
| 2010 | ||
| 25 | Alexandre Goldsztejn, Olivier Mullier, Damien Eveillard, Hiroshi Hosobe: Including Ordinary Differential Equations Based Constraints in the Standard CP Framework. CP 2010: 221-235 | |
| 24 | Nicolas Berger, Ricardo Soto, Alexandre Goldsztejn, Stéphane Caro, Philippe Cardou: Finding the Maximal Pose Error in Robotic Mechanical Systems Using Constraint Programming. IEA/AIE (1) 2010: 82-91 | |
| 23 | Alexandre Goldsztejn, Frédéric Goualard: Box consistency through adaptive shaving. SAC 2010: 2049-2054 | |
| 22 | Alexandre Goldsztejn, Laurent Granvilliers: A new framework for sharp and efficient resolution of NCSP with manifolds of solutions. Constraints 15(2): 190-212 (2010) | |
| 21 | Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou: A branch and bound algorithm for numerical Max-CSP. Constraints 15(2): 213-237 (2010) | |
| 2009 | ||
| 20 | Raphaël Chenouard, Alexandre Goldsztejn, Christophe Jermann: Search Strategies for an Anytime Usage of the Branch and Prune Algorithm. IJCAI 2009: 468-473 | |
| 19 | Alexandre Goldsztejn: On the Exponentiation of Interval Matrices CoRR abs/0908.3954: (2009) | |
| 18 | Alexandre Goldsztejn, Claude Michel, Michel Rueher: Efficient handling of universally quantified inequalities. Constraints 14(1): 117-135 (2009) | |
| 2008 | ||
| 17 | Alexandre Goldsztejn, Laurent Granvilliers: A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions. CP 2008: 190-204 | |
| 16 | Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou: A Branch and Bound Algorithm for Numerical MAX-CSP. CP 2008: 205-219 | |
| 15 | Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher: Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm. CP 2008: 598-602 | |
| 14 | Frédéric Goualard, Alexandre Goldsztejn: A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations. PDCAT 2008: 39-46 | |
| 13 | Alexandre Goldsztejn, Claude Michel, Michel Rueher: An efficient algorithm for a sharp approximation of universally quantified inequalities. SAC 2008: 134-139 | |
| 12 | Frédéric Goualard, Alexandre Goldsztejn: A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations CoRR abs/0806.2548: (2008) | |
| 11 | Alexandre Goldsztejn, Claude Michel, Michel Rueher: An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities CoRR abs/0807.2269: (2008) | |
| 10 | Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher: Revisiting the upper bounding process in a safe Branch and Bound algorithm CoRR abs/0807.2382: (2008) | |
| 9 | Alexandre Goldsztejn: Sensitivity Analysis Using a Fixed Point Interval Iteration CoRR abs/0811.2984: (2008) | |
| 8 | Pieter Collins, Alexandre Goldsztejn: The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. Electr. Notes Theor. Comput. Sci. 223: 87-102 (2008) | |
| 2007 | ||
| 7 | Alexandre Goldsztejn: Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests. Computing 79(1): 53-60 (2007) | |
| 6 | Gilles Chabert, Alexandre Goldsztejn: Extension of the Hansen-Bliek Method to Right-Quantified Linear Systems. Reliable Computing 13(4): 325-349 (2007) | |
| 2006 | ||
| 5 | Alexandre Goldsztejn, Luc Jaulin: Inner and Outer Approximations of Existentially Quantified Equality Constraints. CP 2006: 198-212 | |
| 4 | Alexandre Goldsztejn, Gilles Chabert: A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems. Numerical Methods and Applications 2006: 312-319 | |
| 3 | Alexandre Goldsztejn: A branch and prune algorithm for the approximation of non-linear AE-solution sets. SAC 2006: 1650-1654 | |
| 2 | Carlos Grandón, Alexandre Goldsztejn: Inner approximation of distance constraints with existential quantification of parameters. SAC 2006: 1660-1661 | |
| 2005 | ||
| 1 | Alexandre Goldsztejn: A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-Solution Sets. Reliable Computing 11(6): 443-478 (2005) | |
| 1 | Vicente Ruiz de Angulo | [27] |
| 2 | Frédéric Benhamou | [16] [21] |
| 3 | Nicolas Berger | [24] |
| 4 | Philippe Cardou | [24] |
| 5 | Stéphane Caro | [24] |
| 6 | Gilles Chabert | [4] [6] |
| 7 | Raphaël Chenouard | [20] |
| 8 | Marc Christie | [16] [21] |
| 9 | Pieter Collins | [8] [26] |
| 10 | Damien Eveillard | [25] |
| 11 | Frédéric Goualard | [12] [14] [23] |
| 12 | Carlos Grandón | [2] |
| 13 | Laurent Granvilliers | [17] [22] |
| 14 | Wayne Hayes | [26] |
| 15 | Hiroshi Hosobe | [25] |
| 16 | Luc Jaulin | [5] |
| 17 | Christophe Jermann | [20] [27] |
| 18 | Yahia Lebbah | [10] [15] |
| 19 | Claude Michel | [10] [11] [13] [15] [18] |
| 20 | Olivier Mullier | [25] |
| 21 | Jean-Marie Normand | [16] [21] |
| 22 | Michel Rueher | [10] [11] [13] [15] [18] |
| 23 | Ricardo Soto | [24] |
| 24 | Carme Torras (Carme Torras Genís) | [27] |
Colors in the list of coauthors
Last update Fri May 25 01:42:58 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page