The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

José Luis Montaña: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. César Luis Alonso, Fernando Caro, José Luis Montaña
    A Flipping Local Search Genetic Algorithm for the Multidimensional 0-1 Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    CAEPIA, 2005, pp:21-30 [Conf]
  2. César Luis Alonso, Fátima Drubi, José Luis Montaña
    An Evolutionary Algorithm for Solving Word Equation Systems. [Citation Graph (0, 0)][DBLP]
    CAEPIA, 2003, pp:147-156 [Conf]
  3. César Luis Alonso, Fernando Caro, José Luis Montaña
    An Evolutionary Strategy for the Multidimensional 0-1 Knapsack Problem Based on Genetic Computation of Surrogate Multipliers. [Citation Graph (0, 0)][DBLP]
    IWINAC (2), 2005, pp:63-73 [Conf]
  4. Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    Combinatorial Hardness Proofs for Polynomial Evaluation. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:167-175 [Conf]
  5. César Luis Alonso, José Luis Montaña, Luis Miguel Pardo
    On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:83-94 [Conf]
  6. César Luis Alonso, Fátima Drubi, Judith Gómez-García, José Luis Montaña
    Word Equation Systems: The Heuristic Approach. [Citation Graph (0, 0)][DBLP]
    SBIA, 2004, pp:83-92 [Conf]
  7. José Luis Montaña, Jose Enrique Morais, Luis Miguel Pardo
    Lower Bounds for Arithmetic Networks II: Sum of Betti Numbers. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1995, v:7, n:1, pp:41-51 [Journal]
  8. José Luis Montaña, Luis Miguel Pardo
    Lower Bounds for Arithmetic Networks. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1993, v:4, n:, pp:1-24 [Journal]
  9. José Luis Montaña, Luis Miguel Pardo, Tomás Recio
    A Note on Rabin's Width of a Complete Proof. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:12-36 [Journal]
  10. D. Castro, José Luis Montaña, Luis Miguel Pardo, Jorge San Martín
    The Distribution of Condition Numbers of Rational Data of Bounded Bit Length. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2002, v:2, n:1, pp:1-52 [Journal]
  11. José Luis Montaña, Luis Miguel Pardo
    On Kolmogorov Complexity in the Real Turing Machine Setting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:2, pp:81-86 [Journal]
  12. Mikel Aldaz, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    Time-Space Tradeoffs in Algebraic Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:2-49 [Journal]
  13. Mikel Aldaz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo
    A new method to obtain lower bounds for polynomial evaluation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:577-596 [Journal]
  14. César Luis Alonso, José Luis Montaña
    Vapnik-Chervonenkis Dimension of Parallel Arithmetic Computations. [Citation Graph (0, 0)][DBLP]
    ALT, 2007, pp:107-119 [Conf]
  15. César Luis Alonso, José Luis Montaña
    Finiteness Properties of Some Families of GP-Trees. [Citation Graph (0, 0)][DBLP]
    CAEPIA, 2007, pp:190-199 [Conf]
  16. César Luis Alonso, David Alonso, Mar Callau, José Luis Montaña
    A Word Equation Solver Based on Levensthein Distance. [Citation Graph (0, 0)][DBLP]
    MICAI, 2007, pp:316-326 [Conf]

  17. VC Dimension Bounds for Analytic Algebraic Computations. [Citation Graph (, )][DBLP]


  18. VCD Bounds for some GP Genotypes. [Citation Graph (, )][DBLP]


  19. Adaptation, Performance and Vapnik-Chervonenkis Dimension of Straight Line Programs. [Citation Graph (, )][DBLP]


  20. Computing Surrogate Constraints for Multidimensional Knapsack Problems Using Evolution Strategies. [Citation Graph (, )][DBLP]


  21. Straight Line Programs: A New Linear Genetic Programming Approach. [Citation Graph (, )][DBLP]


  22. Evolution Strategies for Constants Optimization in Genetic Programming. [Citation Graph (, )][DBLP]


  23. Lower Bounds for Approximation of Some Classes of Lebesgue Measurable Functions by Sigmoidal Neural Networks. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.014secs
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