The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexandre Goldsztejn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexandre Goldsztejn, Luc Jaulin
    Inner and Outer Approximations of Existentially Quantified Equality Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:198-212 [Conf]
  2. Alexandre Goldsztejn, Gilles Chabert
    A Generalized Interval LU Decomposition for the Solution of Interval Linear Systems. [Citation Graph (0, 0)][DBLP]
    Numerical Methods and Applications, 2006, pp:312-319 [Conf]
  3. Alexandre Goldsztejn
    A branch and prune algorithm for the approximation of non-linear AE-solution sets. [Citation Graph (0, 0)][DBLP]
    SAC, 2006, pp:1650-1654 [Conf]
  4. Carlos Grandón, Alexandre Goldsztejn
    Inner approximation of distance constraints with existential quantification of parameters. [Citation Graph (0, 0)][DBLP]
    SAC, 2006, pp:1660-1661 [Conf]
  5. Alexandre Goldsztejn
    A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-Solution Sets. [Citation Graph (0, 0)][DBLP]
    Reliable Computing, 2005, v:11, n:6, pp:443-478 [Journal]
  6. Alexandre Goldsztejn
    Comparison of the Hansen-Sengupta and the Frommer-Lang-Schnurr existence tests. [Citation Graph (0, 0)][DBLP]
    Computing, 2007, v:79, n:1, pp:53-60 [Journal]

  7. A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions. [Citation Graph (, )][DBLP]


  8. A Branch and Bound Algorithm for Numerical MAX-CSP. [Citation Graph (, )][DBLP]


  9. Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm. [Citation Graph (, )][DBLP]


  10. Search Strategies for an Anytime Usage of the Branch and Prune Algorithm. [Citation Graph (, )][DBLP]


  11. A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations. [Citation Graph (, )][DBLP]


  12. An efficient algorithm for a sharp approximation of universally quantified inequalities. [Citation Graph (, )][DBLP]


  13. Box consistency through adaptive shaving. [Citation Graph (, )][DBLP]


  14. Efficient handling of universally quantified inequalities. [Citation Graph (, )][DBLP]


  15. A Data-Parallel Algorithm to Reliably Solve Systems of Nonlinear Equations [Citation Graph (, )][DBLP]


  16. An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities [Citation Graph (, )][DBLP]


  17. Revisiting the upper bounding process in a safe Branch and Bound algorithm [Citation Graph (, )][DBLP]


  18. Sensitivity Analysis Using a Fixed Point Interval Iteration [Citation Graph (, )][DBLP]


  19. On the Exponentiation of Interval Matrices [Citation Graph (, )][DBLP]


  20. The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002